Abstract
State space analysis is a popular formal reasoning technique. However, it is subject to the crippling problem of state space explosion, where its application to real world models leads to unmanageably large state spaces. In this paper we present algorithms which attempt to alleviate the state space explosion problem by taking advantage of the common practice of incremental development, i.e. where the designer starts withan abstract model of the system and progressively refines it. The performance of the incremental algorithm is compared to that of the standard algorithm for some case studies, and situations under which the performance improvement can be expected are identified.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S. Christensen and L. Petrucci. Modular Analysis of Petri Nets. The Computer Journal, 43(3):224–242, 2000.
S. Gordon and J. Billington. Analysing a Missile Simulator using Coloured Petri Nets. International Journal on Software Tools for Technology Transfer, 2(2):144–159, December 1998.
K. Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Volume 1, Analysis Methods. Monographs in Theoretical Computer Science. Springer-Verlag, 1992.
K. Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Volume 2, Analysis Methods. Monographs in Theoretical Computer Science. Springer-Verlag, 1995.
C.A. Lakos. Composing Abstractions of Coloured Petri Nets. In 21st International Conference on Application and Theory of Petri Nets (ICATPN’2000) Aarhus, Denmark, June 25-29, 2000, volume 1825 of Lecture Notes in Computer Science, pages 323–342, June 2000.
C.A. Lakos and J. Lamp. The Incremental Modelling of the Z39.50 Protocol with Object Petri Nets. In J. Billington, M. Diaz, and G. Rozenberg, editors, Application of Petri nets to Communication Networks: Advances in Petri Nets, volume 1605 of Lecture Notes in Computer Science, pages 37–68. Springer-Verlag, 1999.
G.A. Lewis. An Incremental Perspective-Incremental Development and Incremental Analysis in the Context of Coloured Petri Nets. PhD thesis, Department of Computing, University of Tasmania, Hobart, Tasmania, Australia. (to be submitted).
M. Mäkelä. Maria-Modular Reachability Analyzer for Many-Sorted Petri Nets. Helsinki University of Technology, Espoo, Finland, 1999. version 0.1.
M. Mäkelä. A Reachability Analyser for Algebraic System Nets. Licentiate thesis, Helsinki University of Technology, Theoretical Computer Science Laboratory, Espoo, Finland, March2000.
A. Valmari. The State Explosion Problem. In W. Reisig and G. Rozenberg, editors, Lectures on Petri Nets I: Advances in Petri Nets, volume 1491 of Lecture Notes in Computer Science, pages 429–528. Springer-Verlag, 19
K. Varpaaniemi, J. Halme, K. Hiekkanen, and T. Pyssysalo. PROD reference manual. Technical Report B13, Helsinki University of Technology, Department of Computer Science and Engineering, Digital Systems Laboratory, Espoo, Finland, August 1995.
W. Vogler, W. Brauer, and R. Gold. A Survey of Behaviour and Equivalence Preserving Refinements of Petri Nets. In Advances in Petri Nets 1990, volume 483 of Lecture Notes in Computer Science, pages 1–46. Springer-Verlag, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lewis, G., Lakos, C. (2001). Incremental State Space Construction for Coloured Petri Nets. In: Colom, JM., Koutny, M. (eds) Applications and Theory of Petri Nets 2001. ICATPN 2001. Lecture Notes in Computer Science, vol 2075. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45740-2_16
Download citation
DOI: https://doi.org/10.1007/3-540-45740-2_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42252-5
Online ISBN: 978-3-540-45740-4
eBook Packages: Springer Book Archive