Vector Addition System Reversible Reachability Problem

  • Jérôme Leroux
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6901)


The reachability problem for vector addition systems is a central problem of net theory. This problem is known to be decidable but the complexity is still unknown. Whereas the problem is EXPSPACE-hard, no elementary upper bounds complexity are known. In this paper we consider the reversible reachability problem. This problem consists to decide if two configurations are reachable one from each other. We show that this problem is EXPSPACE-complete. As an application of the introduced materials we characterize the reversibility domains of a vector addition system.


Coverability Problem Simple Cycle Total Cycle Reachability Problem Projected Component 
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. [BF97]
    Bouziane, Z., Finkel, A.: Cyclic petri net reachability sets are semi-linear effectively constructible. Electr. Notes Theor. Comput. Sci. 9 (1997)Google Scholar
  2. [CLM76]
    Cardoza, E., Lipton, R.J., Meyer, A.R.: Exponential space complete problems for petri nets and commutative semigroups: Preliminary report. In: STOC 1976, pp. 50–54. ACM, New York (1976)Google Scholar
  3. [EN94]
    Esparza, J., Nielsen, M.: Decidability issues for petri nets - a survey. Bulletin of the European Association for Theoretical Computer Science 52, 245–262 (1994)zbMATHGoogle Scholar
  4. [Hau90]
    Hauschildt, D.: Semilinearity of the Reachability Set is Decidable for Petri Nets. PhD thesis, University of Hamburg (1990)Google Scholar
  5. [Kos82]
    Rao Kosaraju, S.: Decidability of reachability in vector addition systems (preliminary version). In: Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing (STOC 1982), San Francisco, California, USA, May 5-7, pp. 267–281. ACM, New York (1982)CrossRefGoogle Scholar
  6. [Lam92]
    Lambert, J.L.: A structure to decide reachability in petri nets. Theoretical Computer Science 99(1), 79–104 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  7. [Ler11]
    Leroux, J.: Vector addition system reachability problem: a short self-contained proof. In: Ball, T., Sagiv, M. (eds.) Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2011, Austin, TX, USA, January 26-28, pp. 307–316. ACM, New York (2011)Google Scholar
  8. [May81]
    Mayr, E.W.: An algorithm for the general petri net reachability problem. In: Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation, STOC 1981, Milwaukee, Wisconsin, USA, May 11-13, pp. 238–246. ACM, New York (1981)Google Scholar
  9. [Pot91]
    Pottier, L.: Minimal solutions of linear diophantine systems: Bounds and algorithms. In: Book, R.V. (ed.) RTA 1991. LNCS, vol. 488, pp. 162–173. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  10. [Rac78]
    Rackoff, C.: The covering and boundedness problems for vector addition systems. Theoretical Computer Science 6(2) (1978)Google Scholar
  11. [ST77]
    Sacerdote, G.S., Tenney, R.L.: The decidability of the reachability problem for vector addition systems (preliminary version). In: Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, Boulder, Colorado, USA, May 2-4, pp. 61–76. ACM, New York (1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jérôme Leroux
    • 1
  1. 1.LaBRI, Université Bordeaux 1, CNRSFrance

Personalised recommendations