Advertisement

Co-finiteness and Co-emptiness of Reachability Sets in Vector Addition Systems with States

  • Petr JančarEmail author
  • Jérôme Leroux
  • Grégoire Sutre
Conference paper
  • 529 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10877)

Abstract

The coverability and boundedness problems are well-known exponential-space complete problems for vector addition systems with states (or Petri nets). The boundedness problem asks if the reachability set (for a given initial configuration) is finite. Here we consider a dual problem, the co-finiteness problem that asks if the complement of the reachability set is finite; by restricting the question we get the co-emptiness (or universality) problem that asks if all configurations are reachable.

We show that both the co-finiteness problem and the co-emptiness problem are complete for exponential space. While the lower bounds are obtained by a straightforward reduction from coverability, getting the upper bounds is more involved; in particular we use the bounds derived for reversible reachability by Leroux in 2013.

The studied problems have been motivated by a recent result for structural liveness of Petri nets; this problem has been shown decidable by Jančar in 2017 but its complexity has not been clarified. The problem is tightly related to a generalization of the co-emptiness problem for non-singleton sets of initial markings, in particular for downward closed sets. We formulate the problems generally for semilinear sets of initial markings, and in this case we show that the co-emptiness problem is decidable (without giving an upper complexity bound) and we formulate a conjecture under which the co-finiteness problem is also decidable.

References

  1. 1.
    Atig, M.F., Habermehl, P.: On Yen’s path logic for Petri nets. Int. J. Found. Comput. Sci. 22(4), 783–799 (2011).  https://doi.org/10.1142/S0129054111008428MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Best, E., Esparza, J.: Existence of home states in Petri nets is decidable. Inf. Process. Lett. 116(6), 423–427 (2016)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Esparza, J.: Decidability and complexity of Petri net problems—an introduction. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1998. LNCS, vol. 1491, pp. 374–428. Springer, Heidelberg (1998).  https://doi.org/10.1007/3-540-65306-6_20CrossRefzbMATHGoogle Scholar
  4. 4.
    Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pac. J. Math. 16(2), 285–296 (1966)MathSciNetCrossRefGoogle Scholar
  5. 5.
    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, 14–16 October 1974, pp. 156–164. IEEE Computer Society (1974).  https://doi.org/10.1109/SWAT.1974.28
  6. 6.
    Hopcroft, J.E., Pansiot, J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comput. Sci. 8, 135–159 (1979)MathSciNetCrossRefGoogle Scholar
  7. 7.
    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. LNCS, vol. 10139, pp. 91–102. Springer, Cham (2017).  https://doi.org/10.1007/978-3-319-51963-0_8CrossRefGoogle Scholar
  8. 8.
    Leroux, J.: Presburger vector addition systems. In: 28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, 25–28 June 2013, pp. 23–32. IEEE Computer Society (2013).  https://doi.org/10.1109/LICS.2013.7
  9. 9.
    Leroux, J.: Vector addition system reversible reachability problem. Log. Methods Comput. Sci. 9(1), 1–16 (2013).  https://doi.org/10.2168/LMCS-9(1:5)2013MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Leroux, J., Schmitz, S.: Demystifying reachability in vector addition systems. In: 30th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2015, Kyoto, Japan, 6–10 July 2015, pp. 56–67. IEEE Computer Society (2015).  https://doi.org/10.1109/LICS.2015.16
  11. 11.
    Lipton, R.J.: The reachability problem requires exponential space. Technical report 63, Department of Computer Science, Yale University, January 1976Google Scholar
  12. 12.
    Mayr, E.W.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441–460 (1984).  https://doi.org/10.1137/0213029MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6, 223–231 (1978).  https://doi.org/10.1016/0304-3975(78)90036-1MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Yen, H.: A unified approach for deciding the existence of certain Petri net paths. Inf. Comput. 96(1), 119–137 (1992).  https://doi.org/10.1016/0890-5401(92)90059-OMathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2018

Authors and Affiliations

  • Petr Jančar
    • 1
    Email author
  • Jérôme Leroux
    • 2
  • Grégoire Sutre
    • 2
  1. 1.Department of Computer Science, Faculty of SciencePalacký UniversityOlomoucCzech Republic
  2. 2.University of Bordeaux, CNRS, LaBRI, UMR 5800TalenceFrance

Personalised recommendations