Structural liveness of Petri nets is ExpSpace-hard and decidable

  • Petr JančarEmail author
  • David Purser
Original Article


Place/transition Petri nets are a standard model for a class of distributed systems whose reachability spaces might be infinite. One of well-studied topics is verification of safety and liveness properties in this model; despite an extensive research effort, some basic problems remain open, which is exemplified by the complexity status of the reachability problem that is still not fully clarified. The liveness problems are known to be closely related to the reachability problem, and various structural properties of nets that are related to liveness have been studied. Somewhat surprisingly, the decidability status of the problem of determining whether a net is structurally live, i.e. whether there is an initial marking for which it is live, remained open for some time; e.g. Best and Esparza (Inf Process Lett 116(6):423–427, 2016. emphasize this open question. Here we show that the structural liveness problem for Petri nets is ExpSpace-hard and decidable. In particular, given a net N and a semilinear set S, it is decidable whether there is an initial marking of N for which the reachability set is included in S; this is based on results by Leroux (28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, New Orleans, LA, USA, June 25–28, 2013, IEEE Computer Society, pp 23–32, 2013.



Both authors thank the anonymous reviewers for their helpful comments, and Dmitry Chistikov for discussions initiating their cooperation when meeting at the University of Warwick. P. Jančar thanks Eike Best for a discussion about the open decidability status of the structural liveness problem, and acknowledges funding by the Grant Agency of the Czech Republic (18-11193S). D. Purser acknowledges funding by the UK Engineering and Physical Sciences Research Council (EP/L016400/1), the EPSRC Centre for Doctoral Training in Urban Science.


  1. 1.
    Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput. 160(1–2), 109–127 (2000). MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Barkaoui, K., Pradat-Peyre, J.: On liveness and controlled siphons in Petri nets. In: Billington, J., Reisig, W. (eds.) Application and Theory of Petri Nets 1996, 17th International Conference, Osaka, Japan, June 24–28, 1996, Proceedings, Lecture Notes in Computer Science, vol. 1091, pp. 57–72. Springer, Berlin (1996).
  3. 3.
    Best, E., Esparza, J.: Existence of home states in Petri nets is decidable. Inf. Process. Lett. 116(6), 423–427 (2016). MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for petri nets and commutative semigroups: preliminary report. In: Proceedings of the 8th Annual ACM Symposium on Theory of Computing, May 3–5, 1976, Hershey, Pennsylvania, USA, pp. 50–54 (1976).
  5. 5.
    Commoner, F., Holt, A.W., Even, S., Pnueli, A.: Marked directed graphs. J. Comput. Syst. Sci. 5(5), 511–523 (1971)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Czerwiński, W., Lasota, S., Lazić, R., Leroux, J., Mazowiecki, F.: The reachability problem for Petri nets is not elementary. In: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, pp. 24–33. ACM, New York (2019).
  7. 7.
    Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press, New York (1995)CrossRefzbMATHGoogle Scholar
  8. 8.
    Esparza, J.: Decidability and complexity of Petri net problems—an introduction. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, LNCS, vol. 1491, pp. 374–428. Springer, Berlin (1996).
  9. 9.
    Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, part II: complete WSTS. Log. Methods Comput. Sci. 8(3), 28 (2012). MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theor. Comput. Sci. 256(1–2), 63–92 (2001). MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pac. J. Math. 16(2), 285–296 (1966)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Hack, M.: Petri Nets and Commutative Semigroups. Massachusetts Institute of Technology, Project MAC. Cambridge, MA, USA (1974)Google Scholar
  13. 13.
    Hack, M.: The recursive equivalence of the reachability problem and the liveness problem for Petri nets and vector addition systems. In: 15th Annual Symposium on Switching and Automata Theory, New Orleans, Louisiana, USA, October 14–16, 1974, pp. 156–164. IEEE Computer Society (1974).
  14. 14.
    Hack, M.: Decidability Questions for Petri Nets. Outstanding Dissertations in the Computer Sciences. Garland Publishing, New York (1975)Google Scholar
  15. 15.
    Jančar, P.: Deciding structural liveness of Petri nets. In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds.) SOFSEM 2017: Theory and Practice of Computer Science—43rd International Conference on Current Trends in Theory and Practice of Computer Science, Limerick, Ireland, January 16–20, 2017, Proceedings, Lecture Notes in Computer Science, vol. 10139, pp. 91–102. Springer, Berlin (2017).
  16. 16.
    Johnsonbaugh, R., Murata, T.: Petri nets and marked graphs-mathematical models of concurrent computation. Am. Math. Mon. 89(8), 552–566 (1982)MathSciNetzbMATHGoogle Scholar
  17. 17.
    Leroux, J.: Vector addition systems reachability problem (a simpler solution). In: Voronkov, A. (ed.) Turing-100—The Alan Turing Centenary, Manchester, UK, June 22–25, 2012, EasyChair, EPiC Series in Computing, vol. 10, pp. 214–228 (2012).
  18. 18.
    Leroux, J.: Presburger vector addition systems. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25–28, 2013, pp. 23–32. IEEE Computer Society (2013).
  19. 19.
    Leroux, J., Schmitz, S.: Reachability in vector addition systems is primitive-recursive in fixed dimension. In: 34th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2019, Vancouver, Canada, June 24–27, 2019. IEEE Computer Society (2019)Google Scholar
  20. 20.
    Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441–460 (1984). MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    Mayr, E.W.: Some complexity results for polynomial ideals. J. Complex. 13(3), 303–325 (1997). MathSciNetCrossRefzbMATHGoogle Scholar
  22. 22.
    Mayr, E.W., Meyer, A.R.: The complexity of the word problems for commutative semigroups and polynomial ideals. Adv. Math. 46(3), 305–329 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223–231 (1978). MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Reisig, W.: Understanding Petri Nets (Modeling Techniques, Analysis Methods, Case Studies). Springer, Berlin (2013). CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of Computer Science, Faculty of SciencePalacký UniversityOlomoucCzech Republic
  2. 2.Centre for Discrete Mathematics and Its Applications (DIMAP) and Department of Computer ScienceUniversity of WarwickCoventryUK

Personalised recommendations