Abstract
State Space Analysis is one of the most developed analysis methods for Petri Nets. The main problem of state space analysis is the size of the state spaces. Several ways to reduce it have been proposed but cannot yet handle industrial size systems.
Large models often consist of a set of modules. Local properties of each module can be checked separately, before checking the validity of the entire system. We want to avoid the construction of a single state space of the entire system.
When considering transition sharing, the behaviour of the total system can be captured by the state spaces of modules combined with a Synchronisation Graph. To verify that we do not lose information we show how the full state space can be constructed.
We show how it is possible to determine usual Petri Nets properties, without unfolding to the ordinary state space.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Christensen, L. O. Jepsen: Modelling and simulation of a network management system using hierarchical coloured Petri nets. In Erik Mosekilde (ed.): Proceedings of the 1991 European Simulation Multiconference. ISBN 0-911801-92-8, pp. 47–52. An extended version available as: Daimi PB-349, ISSN 0105-8517, April 1991.
S. Christensen, L. Petrucci: Towards a modular analysis of coloured Petri nets. In: K. Jensen (ed.): Application and Theory of Petri Nets 1992. Lecture Notes in Computer Science, vol. 616, Springer-Verlag, 1992, 113–133. Also available as: Daimi PB-391, ISSN 0105–8517, April 1992.
P. Huber, K. Jensen and R. M. Shapiro: Hierarchies in coloured Petri nets. In: G. Rozenberg (ed.): Advances in Petri Nets 1990. Lecture Notes in Computer Science, vol. 383. Springer-Verlag, 1990, pp. 342–416. Also in [JR91], pp. 215–243.
K. Jensen: Coloured Petri nets. Basic concepts, analysis methods and practical use. Volume 1: Basic concepts. EATCS monographs on Theoretical Computer Science, Springer-Verlag 1992.
K. Jensen: Coloured Petri nets. Basic concepts, analysis methods and practical use. Volume 2: Analysis methods. To appear in: EATCS monographs on Theoretical Computer Science, Springer-Verlag 1994.
K. Jensen and G. Rozenberg (eds.): High-level Petri nets: theory and application. Springer-Verlag 1991. ISBN 3-540-54125-X/0-387-54125-X.
M. Notomi and T. Murata, Hierarchical reachability graph of bounded Petri nets for concurrent-software analysis. IEEE Transactions on Software Engineering, pp. 325–336, Vol. 20, No. 5 May 1994.
The Design/CPN occurrence graph analyzer. Version 0.5, Meta Software Corporation. Daimi version — March, 1995, unpublished.
A. Valmari: Compositional state space generation. Proceedings of the 11th International Conference on Application and Theory of Petri Nets, Paris, France, June 1990. pp. 43–62.
A. Valmari: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.): Advances in Petri Nets 1990. Lecture Notes in Computer Science, Vol. 483; Springer-Verlag 1991, pp. 491–515.
A. Valmari: Stubborn sets of coloured Petri nets. Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Gjern, Denmark, June 1991, pp. 102–121.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Christensen, S., Petrucci, L. (1995). Modular state space analysis of coloured Petri Nets. In: De Michelis, G., Diaz, M. (eds) Application and Theory of Petri Nets 1995. ICATPN 1995. Lecture Notes in Computer Science, vol 935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60029-9_41
Download citation
DOI: https://doi.org/10.1007/3-540-60029-9_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60029-9
Online ISBN: 978-3-540-49408-9
eBook Packages: Springer Book Archive