Skip to main content

Incremental State Space Construction for Coloured Petri Nets

  • Conference paper
  • First Online:
Applications and Theory of Petri Nets 2001 (ICATPN 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2075))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Christensen and L. Petrucci. Modular Analysis of Petri Nets. The Computer Journal, 43(3):224–242, 2000.

    Article  MATH  Google Scholar 

  2. 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.

    Article  MATH  Google Scholar 

  3. K. Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Volume 1, Analysis Methods. Monographs in Theoretical Computer Science. Springer-Verlag, 1992.

    Google Scholar 

  4. K. Jensen. Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use: Volume 2, Analysis Methods. Monographs in Theoretical Computer Science. Springer-Verlag, 1995.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. 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.

    Chapter  Google Scholar 

  7. 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).

    Google Scholar 

  8. M. Mäkelä. Maria-Modular Reachability Analyzer for Many-Sorted Petri Nets. Helsinki University of Technology, Espoo, Finland, 1999. version 0.1.

    Google Scholar 

  9. M. Mäkelä. A Reachability Analyser for Algebraic System Nets. Licentiate thesis, Helsinki University of Technology, Theoretical Computer Science Laboratory, Espoo, Finland, March2000.

    Google Scholar 

  10. 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

    Google Scholar 

  11. 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.

    Google Scholar 

  12. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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

Publish with us

Policies and ethics