Skip to main content
SpringerLink
Log in
Book cover

International Conference on Application and Theory of Petri Nets

ICATPN 2003: Applications and Theory of Petri Nets 2003 pp 201–220Cite as

Model Checking Safety Properties in Modular High-Level Nets

  • Conference paper
  • First Online:

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

Abstract

Model checking by exhaustive state space enumeration is one of the most developed analysis methods for distributed event systems. Its main problem—the size of the state spaces—has been addressed by various reduction methods.

Complex systems tend to consist of loosely connected modules, which may perform internal tasks in parallel. The possible interleavings of these parallel tasks easily leads to a large number of reachable global states. In modular state space analysis, the internal actions are explored separately in each module, and the global state space only includes synchronisations.

This article introduces nested modular nets, which are hierarchal collections of nets synchronising via shared transitions, and presents a simple algorithm for model checking safety properties in modular systems.

This research was supported by Jenny and Antti Wihuri Fund and by Academy of Finland (Project 47754).

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Eugenio Battiston, Fiorella De Cindio, and Giancarlo Mauri. Modular algebraic nets to specify concurrent systems. IEEE Transactions on Software Engineering, 22(10):689–705, October 1996.

    Article  Google Scholar 

  2. Jonathan Billington et al. High-level Petri nets—concepts, definitions and graphical notation, version 4.7.3. Final Draft International Standard ISO/IEC 15909, ISO/IEC JTC1/SC7, Genève, Switzerland, May 2002.

    Google Scholar 

  3. Shing Chi Cheung and Jeff Kramer. Checking safety properties using compositional reachability analysis. ACM TOSEM, 8(1):49–78, January 1999.

    Article  Google Scholar 

  4. Søren Christensen and Laure Petrucci. Modular state space analysis of coloured Petri nets. In Giorgio De Michelis and Michel Diaz, editors, Application and Theory of Petri Nets 1995, 16 th International Conference, volume 935 of Lecture Notes in Computer Science, pages 201–217, Turin, Italy, June 1995. Springer-Verlag.

    Google Scholar 

  5. Søren Christensen and Laure Petrucci. Modular analysis of Petri nets. The Computer Journal, 43(3):224–242, 2000.

    Article  MATH  Google Scholar 

  6. Danny Dolev, Maria Klawe, and Michael Rodeh. An O(n log n) unidirectional distributed algorithm for extrema finding in a circle. Journal of Algorithms, 3(3):245–260, September 1982.

    Article  MATH  MathSciNet  Google Scholar 

  7. Orna Grumberg and David E. Long. Model checking and modular verification. ACM TOPLAS, 16(3):843–871, May 1994.

    Article  Google Scholar 

  8. Gerard J. Holzmann. Spin—formal verification. http://spinroots.com/.

    Google Scholar 

  9. Specification and description language (SDL). Recommendation Z.100 (08/02), International Telecommunication Union, Geneva, Switzerland, September 2002.

    Google Scholar 

  10. Eric Y. T. Juan, Jeffrey J. P. Tsai, and Tadao Murata. Compositional verification of concurrent systems using Petri-net-based condensation rules. ACM TOPLAS, 20(5):917–979, September 1998.

    Article  Google Scholar 

  11. Bengi Karaçalı and Kuo-Chung Tai. Model checking based on simultaneous reachability analysis. In Klaus Havelund, John Penix, and Willem Visser, editors, SPIN Model Checking and Software Verification, 7 th International SPIN Workshop, volume 1885 of Lecture Notes in Computer Science, pages 34–53, Stanford, CA, USA, August 2000. Springer-Verlag.

    Google Scholar 

  12. Orna Kupferman and Moshe Y. Vardi. Model checking of safety properties. In Nicolas Halbwachs and Doron Peled, editors, Computer Aided Verification 1999, 11 th International Conference (CAV99), volume 1633 of Lecture Notes in Computer Science, pages 172–183, Trento, Italy, July 1999. Springer-Verlag.

    Google Scholar 

  13. Marko Mäkelä. Optimising enabling tests and unfoldings of algebraic system nets. In José-Manuel Colom and Maciej Koutny, editors, Application and Theory of Petri Nets 2001, 22 nd International Conference, volume 2075 of Lecture Notes in Computer Science, pages 283–302, Newcastle upon Tyne, England, June 2001. Springer-Verlag.

    Google Scholar 

  14. Marko Mäkelä. Efficiently verifying safety properties with idle office computers. In Charles Lakos, Robert Esser, Lars M. Kristensen, and Jonathan Billington, editors, Formal Methods in Software Engineering and Defence Systems 2002, volume 12 of Conferences in Research and Practice in Information Technology, pages 11–16, Adelaide, Australia, June 2002. Australian Computer Society Inc.

    Google Scholar 

  15. Marko Mäkelä. Maria: Modular reachability analyser for algebraic system nets. In Javier Esparza and Charles Lakos, editors, Application and Theory of Petri Nets 2002, 23 rd International Conference, volume 2360 of Lecture Notes in Computer Science, pages 434–444, Adelaide, Australia, June 2002. Springer-Verlag.

    Google Scholar 

  16. Laure Petrucci. Design and validation of a controller. In Proceedings of the 4 th World Multiconference on Systemics, Cybernetics and Informatics, volume VIII, pages 684–688, Orlando, FL, USA, July 2000. International Institute of Informatics and Systemics.

    Google Scholar 

  17. Ulrich Stern and David L. Dill. Parallelizing the Murϕ verifier. In Orna Grumberg, editor, Computer Aided Verification 1997, 9 th International Conference (CAV97), volume 1254 of Lecture Notes in Computer Science, pages 256–267, Haifa, Israel, June 1997. Springer-Verlag.

    Google Scholar 

  18. Antti Valmari. The state explosion problem. In Wolfgang Reisig and Grzegorz Rozenberg, editors, Lectures on Petri Nets I: Basic Models, volume 1491 of Lecture Notes in Computer Science, pages 429–528. Springer-Verlag, 1998.

    Google Scholar 

  19. Wei Jen Yeh and Michal Young. Compositional reachability analysis using process algebra. In Proceedings of the Symposium on Software Testing, Analysis, and Verification, pages 49–59, Victoria, British Columbia, October 1991. ACM Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O.Box 9205, 02015, Hut, Finland

    Marko Mäkelä

Authors
  1. Marko Mäkelä
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Technology and Management, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Wil M. P. van der Aalst

  2. Computer Science Department Parallel Systems Group, University of Oldenburg, 26111, Oldenburg, Germany

    Eike Best

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mäkelä, M. (2003). Model Checking Safety Properties in Modular High-Level Nets. In: van der Aalst, W.M.P., Best, E. (eds) Applications and Theory of Petri Nets 2003. ICATPN 2003. Lecture Notes in Computer Science, vol 2679. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44919-1_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-44919-1_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40334-0

  • Online ISBN: 978-3-540-44919-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation