Decidability and complexity of Petri net problems — An introduction

  • Javier Esparza
II Analysis and Synthesis
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1491)


A collection of 10 “rules of thumb” is presented that helps to determine the decidability and complexity of a large number of Petri net problems.


Temporal Logic Atomic Proposition Polynomial Space Counter Program Computation Tree Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J.L. Balcázar, J. Diaz, and J. Gabarró. Structural Complexity I, volume 11 of Monographs in theoretical Computer Science. Springer-Verlag, 1988.Google Scholar
  2. 2.
    A. Cheng, J. Esparza, and J. Palsberg. Complexity Results for 1-safe Nets. Theoretical Computer Science, 147:117–136, 1995.Google Scholar
  3. 3.
    F. Commoner, A. W. Holt, S. Even, and A. Pnueli. Marked Directed Graphs. Journal of Computer and System Sciences, 5:511–523, 1971.Google Scholar
  4. 4.
    M. Dam. Fixpoints of Biichi automata. In Proceedings of the 12th International Conference of Foundations of Software Technology and Theoretical Computer Science, volume 652 of Lecture Notes in Computer Science, pages 39–50, 1992, Also: LFCS Report, ECS-LFCS-92-224, University of Edinburgh.Google Scholar
  5. 5.
    J. Desel and J. Esparza. Free-choice Petri Nets, volume 40 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1995.Google Scholar
  6. 6.
    E. A. Emerson. Temporal and Modal Logic. In Handbook of Theoretical Computer Science Volume B, pages 995–1027, 1990.Google Scholar
  7. 7.
    J. Esparza. Model Checking Using Net Unfoldings. Science of Computer Programming, 23:151–195, 1994.Google Scholar
  8. 8.
    J. Esparza. Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete. Technical Report SFB-Bericht Nr. 342/12/96 A, Technische Universitiit Miinchen, 1996. To appear in Theoretical Computer Science.Google Scholar
  9. 9.
    J. Esparza. Decidability of Model-Checking for Infinite-State Concurrent Systems. Acta Informatica, 34:85–107, 1997.Google Scholar
  10. 10.
    J. Esparza and M. Nielsen. Decidability Issues for Petri Nets — a Survey In. Bulletin of the EATCS, volume 52, pages 245–262, 1994 Also: Journal of Information Processing and Cybernetics 30(3):143-160, 1995.Google Scholar
  11. 11.
    Formal methodspage of the WWW Virtual Library at Scholar
  12. 12.
    M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, 1979.Google Scholar
  13. 13.
    H. J. Genrich and K. Lautenbach. Synchronisationsgraphen. Acta Informatica, 2:143–161, 1973.Google Scholar
  14. 14.
    P. Habermehl. On the Complexity of the Linear-Time Mu-Calculus for Petri Nets. In P. Azéma and G. Balbo, editors, Application and Theory of Petri Nets, volume 1248 of Lecture Notes in Computer Science, pages 102–116. Springer-Verlag, 1997.Google Scholar
  15. 15.
    M. H. T. Hack. Analysis of Production Schemata by Petri Nets. M.s. thesis, Cambridge, Mass.: MIT, Dept. Electronical Engineering, 1972.Google Scholar
  16. 16.
    J. E. Hopcroft and J. Ullman. Introduction to Automata Theory, Languages and Computation. Additon-Wesley, 1979.Google Scholar
  17. 17.
    R. R. Howell and L. Rosier. On Questions of Fairness and Temporal Logic for Conflict-free Petri Nets. In G. Rozenberg, editor, Advances in Petri Nets, volume 340 of Lecture Notes in Computer Science, pages 200–220, 1988.Google Scholar
  18. 18.
    R. R. Howell and L. E. Rosier. An O(n 1.5) Algorithm to Decide Boundedness for Conflict-free Vector Replacement Systems. Information Processing Letters, 25(1):27–33, 1987.Google Scholar
  19. 19.
    R. R. Howell and L. E. Rosier. Problems Concerning Fairness and Temporal Logic for Conflict-free Petri Nets. Theoretical Computer Science, 64:305–329, 1989.Google Scholar
  20. 20.
    R. R. Howell, L. E. Rosier, and H. Yen. A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. Theoretical Computer Science, 82:341–372, 1991.Google Scholar
  21. 21.
    P. Jančar. All Action-based Behavioural Equivalences are Undecidable for Labelled Petri Nets. Bulletin of EATCS, 56:86–88, 1995.Google Scholar
  22. 22.
    P. Jančar. Undecidability of Bisimilarity for Petri Nets and Some Related Problems. Theoretical Computer Science, 148:281–301, 1995.Google Scholar
  23. 23.
    L. Jategaonkar and A. Meyer. Deciding True Concurrency Equivalences on Safe, Finite Nets. Theoretical Computer Science, 154(1):107–143, 1996.Google Scholar
  24. 24.
    N. D. Jones, L. H. Landweber, and Y. E. Lien. Complexity of Some Problems in Petri Nets. Theoretical Computer Science, 4:277–299, 1977.Google Scholar
  25. 25.
    S.R. Kosaraju. Decidability of Reachability in Vector Addition Systems. In 14th Annual ACM Symposium on Theory of Computing, pages 267–281, San Francisco, 1982.Google Scholar
  26. 26.
    L. Lamport. The Mutual Exclusion Problem. Part II — Statement and Solutions. Journal of the ACM, 33(2), 1986.Google Scholar
  27. 27.
    R. Lipton. The Reachability Problem Requires Exponential Space. Technical Report 62, Yale University, 1976.Google Scholar
  28. 28.
    E. W. Mayr. An Algorithm for the General Petri Net Reachability Problem. SIAM Journal on Computing, 13:441–460, 1984.Google Scholar
  29. 29.
    E.W. Mayr and A.R. Meyer. The Complexity of the Word Problems for Commutative Semigroups and Polynomial Ideals. Advances in Mathematics, 46:305–329, 1982.Google Scholar
  30. 30.
    WWW page on Petri net tools at Scholar
  31. 31.
    A. Rabinovich. Complexity of Equivalence Problems for Concurrent Systems of Finite Agents. Information and Computation, 127(2):164–185, 1997.Google Scholar
  32. 32.
    C. Rackoff. The Covering and Boundedness Problem for Vector Addition Systems. Theoretical Computer Science, 6:223–231, 1978.Google Scholar
  33. 33.
    P. Starke. Analyse von Petri-Netz-Modellen. Teubner, 1990.Google Scholar
  34. 34.
    C. Stirling. Bisimulation, Model Checking and Other Games. Notes for Mathfit instructional meeting on games and computation, Edinburgh, June 1977. Available at Scholar
  35. 35.
    A. Valmari. State Space Generation: Efficiency and Practicality. Phd thesis, Tampere University of Technology, 1988.Google Scholar
  36. 36.
    R. J. van Glabbeek. The Linear Time-Branching Time Spectrum. In Proceedings of CONCUR '90, volume 458 of Lecture Notes in Computer Science, pages 278–297, 1990.Google Scholar
  37. 37.
    M. Vardi. An Automata-Theoretic Approach to Linear temporal Logic. In Logics for Concurrency: Structure versus Automata, volume 1043 of Lecture Notes in Computer Science, pages 238–265, 1996.Google Scholar
  38. 38.
    H. C. Yen. A Unified Approach for Deciding the Existence of Certain Petri Nets Paths. Information and Computation, 96(1):119–137, 1992.Google Scholar
  39. 39.
    H. C. Yen. A Polynomial Time Algorithm to Decide Pairwise Concurrency of Transitions for 1-Bounded Conflict Free Petri Nets. Information Processing Letters, 38:71–76, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Javier Esparza
    • 1
  1. 1.Institut für InformatikTechnische Universität MünchenMünchenGermany

Personalised recommendations