Skip to main content
SpringerLink
Log in

The Petri net twist in explicit model checking

  • Special Section Paper
  • Published:
Software & Systems Modeling Aims and scope Submit manuscript

Abstract

The invention of Petri nets was based on a critical analysis of then dominating automata models of systems. Explicit model checking explores the reachable states of a Petri net one by one. Essentially, it transforms a Petri net back to a transition system, that is, an automata-like model. At first glance, this transformation appears to give up on all the specifics of Petri nets. Surveying the most dominant techniques of explicit state space verification, we will, however, work out that even in explicit model checking, the defining features of Petri nets are beneficial and lead to more efficient exploration routines. The findings in this paper are based on practical experience with a Petri net-based explicit model checking tool.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

References

  1. Bengtsson, J., Larsen, K.G., Larsson, F., Pettersson, P., Wang, Y.: Uppaal–a tool suite for automatic verification of real-time systems. In: Alur, R., Henzinger, T.A., Sontag, E.D. (eds.) Hybrid Systems. Lecture Notes in Computer Science, vol. 1066, pp. 232–243. Springer (1995)

  2. Christensen, S., Kristensen, L.M., Mailund, T.: A sweep-line method for state space exploration. In: Margaria, T., Wang, Y. (eds.) TACAS. Lecture Notes in Computer Science, vol. 2031, pp. 450–464. Springer, UK (2001)

  3. Commoner, F.: Deadlocks in Petri nets. Applied Data Research Inc, Wakefield, Massachusetts, Report CA-7206-2311 (1972)

  4. Das, D., Chakrabarti, P.P., Kumar, R.: Functional verification of task partitioning for multiprocessor embedded systems. ACM Trans. Des. Autom. Electron. Syst. 12(4) (2007). doi:10.1145/1278349.1278357

  5. Desel, J., Reisig, W.: The synthesis problem of Petri nets. Acta Inf. 33(4), 297–315 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  6. Ehrenfeucht, A., Rozenberg, G.: Theory of 2-structures, part i: clans, basic subclasses, and morphisms. Theor. Comput. Sci. 70(3), 277–303 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fahland, D., Favre, C., Koehler, J., Lohmann, N., Völzer, H., Wolf, K.: Analysis on demand: instantaneous soundness checking of industrial business process models. Data Knowl. Eng. 70(5), 448–466 (2011)

    Article  Google Scholar 

  8. Godefroid, P., Wolper, P.: Using partial orders for the efficient verification of deadlock freedom and safety properties. In: Larsen, K.G., Skou, A. (eds.) CAV. Lecture Notes in Computer Science, vol. 575, pp. 332–342. Springer (1991)

  9. Hack, M.H.T.: Analysis of production schemata by Petri nets. Master’s thesis, MIT, Department of Electrical Engineering, Cambridge, Mass (1972)

  10. Heljanko, K., Esparza, J.: Unfoldings—A Partial-Order Approach to Model Checking. Springer, Berlin (2008)

    MATH  Google Scholar 

  11. Huber, P., Jensen, A.M., Jepsen, L.O., Jensen, K.: Towards reachability trees for high-level petri nets. In: Rozenberg, G., Genrich, H.J., Roucairol, G. (eds.) European Workshop on Applications and Theory in Petri Nets. Lecture Notes in Computer Science, vol. 188, pp. 215–233. Springer (1984)

  12. Norris, C., Dill, D.L.: Better verification through symmetry. Form. Methods Syst. Des. 9(1/2), 41–75 (1996)

    Article  Google Scholar 

  13. Kaiser, A., Kroening, D., Wahl, T.: Dynamic cutoff detection in parameterized concurrent programs. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV. Lecture Notes in Computer Science, vol. 6174, pp. 645–659. Springer (2010)

  14. Kordon, F., Linard, A., Buchs, D., Colange, M., Evangelista, S., Lampka, K., Lohmann, N., Paviot-Adet, E., Thierry-Mieg, Y., Wimmel, H.: Report on the model checking contest at Petri nets 2011. T. Petri nets and other models of concurrency 6, 169–196 (2012)

  15. Kristensen, L.M., Mailund, T.: A generalised sweep-line method for safety properties. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME. Lecture Notes in Computer Science, vol. 2391, pp. 549–567. Springer (2002)

  16. Mayr, E.W.: An algorithm for the general petri net reachability problem. SIAM J. Comput. 13(3), 441–460 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  17. Nüttgens, M., Feld, T., Zimmermann, V.: Business process modeling with epc and uml: Transformation or integration? pp. 250–261. In: UML, Workshop (1997)

  18. Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (eds.) Computer Aided Verification: Proceedings of 5th International Conference, CAV ‘93 Elounda, Greece, June 28–July 1. LectureNotes in Computer Science, vol. 697. Springer, Berlin, Heidelberg, pp. 409–423

  19. Petri, C. A.: Kommunikation mit Automaten. In PhD thesis, Technische Universitat Darmstadt, Germany (1962)

  20. Schmidt, K.: How to calculate symmetries of petri nets. Acta Inf. 36(7), 545–590 (2000)

    Article  MATH  Google Scholar 

  21. Schmidt, K.: Integrating low level symmetries into reachability analysis. In: Graf, S., Schwartzbach, M.I. (eds.) TACAS. Lecture Notes in Computer Science, vol. 1785, pp. 315–330. Springer (2000)

  22. Schmidt, K.: Explicit State Space Verification. Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, Berlin, Germany, Dec, Habilitationsschrift (2002)

  23. Schmidt, K.: Automated generation of a progress measure for the sweep-line method. STTT 8(3), 195–203 (2006)

    Article  Google Scholar 

  24. Stahl, C., Reisig, W., Krstic, M.: Hazard detection in a GALS wrapper: a case study. In: Desel, J., Watanabe, Y. (eds.) Proceedings of the Fifth International Conference on Application of Concurrency to System Design (ACSD’05), pp. 234–243. IEEE Computer Society, St. Malo, France (June 2005)

  25. Stern, U., Dill, D.L.: Parallelizing the mur\(\varphi \) verifier. In: Grumberg, O. (ed.) CAV, vol. 1254 of Lecture Notes in Computer Science, pp. 256–278. Springer (1997)

  26. Talcott, C., Dill, D.L.: The pathway logic assistant. In: Third International Workshop on Computational Methods in, Systems Biology, pp. 228–239 (2005)

  27. Valmari, A.: Stubborn sets for reduced state space generation. In Rozenberg, G. (ed.) Applications and Theory of Petri Nets, vol. 483 of Lecture Notes in Computer Science, pp. 491–515. Springer (1989)

  28. Valmari, A.: The state explosion problem. In Reisig, W., Rozenberg, G. (eds.) Petri Nets, vol. 1491 of Lecture Notes in Computer Science, pp. 429–528. Springer (1996)

  29. Verbeek, H.M.W., van der Aalst, W.M.P.: Woflan 2.0: A Petri-net-based workflow diagnosis tool. In: ICATPN, pp. 475–484 (2000)

  30. Wolf, K.: Generating Petri net state spaces. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN. Lecture Notes in Computer Science, vol. 4546, pp. 29–42. Springer (2007)

  31. Wolper, P., Leroy, D.: Reliable hashing without collision detection. In: Courcoubetis, C. (eds.) Computer Aided Verification: Proceedings of 5th International Conference, CAV ‘93 Elounda, Greece, June 28–July 1. LectureNotes in Computer Science, vol. 697. Springer, Berlin, Heidelberg, pp. 59–70

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Rostock, Rostock, Germany

    Karsten Wolf

Authors
  1. Karsten Wolf
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Karsten Wolf.

Additional information

Communicated by Dr. Wolfgang Reisig.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wolf, K. The Petri net twist in explicit model checking. Softw Syst Model 14, 711–717 (2015). https://doi.org/10.1007/s10270-014-0422-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10270-014-0422-4

Keywords

Search

Navigation