The reachability problem for VAS

  • Horst Müller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 188)


Survey on the reachability problem for VAS. Kosaraju's decision procedure with comments on complexity and an example.


Decision Procedure Finite Automaton Reachability Problem Final Node Presburger Arithmetic 
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. [Gra]
    Grabowski, J.: The decidability of Persistence for Vector Addition Systems. Information Processing Letters Vol. 11, No. 1 (1980)Google Scholar
  2. [Hop]
    Hopcroft, J. and Pansiot, J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Comp. Sc. 8, 135–159 (1979)CrossRefGoogle Scholar
  3. [Kos]
    Kosaraju, S.R.: Decidability of reachability in vector addition systems. Proc. 14th Ann. Symp. on Theory of computing, 267–281 (1982, prelim. version)Google Scholar
  4. [Lee]
    van Leeuwen, J.: A partial solution to the reachability problem for vector addition systems. 6th Ann. ACM Symp. on Theory of Computing, 303–309 (1974)Google Scholar
  5. [May1]
    Mayr, E.W.: An algorithm for the general Petri net reachability problem. Proc. 13th Ann. Symp. on Theory of Computing, 238–246 (1981)Google Scholar
  6. [May2]
    Mayr. E.W.: Persistence of Vector Replacement Systems is Decidable. MIT LCS TM 189 (1980)Google Scholar
  7. [Mü1]
    Müller, H.: On the reachability problem for persistent vector replacement systems. Computing Suppl. 3, 89–104 (1981)Google Scholar
  8. [Mü 2]
    Müller, H.: On Kosaraju's Proof of the Decidability of the Reachability Problem for VAS. Report on the 1st GTI-workshop (Ed. L. Priese) Uni-GH Paderborn, Reihe Theoretische Informatik Nr. 13 (1983)Google Scholar
  9. [Mü3]
    Müller, H.: Weak Petri Net Computers for Ackermann functions, (EIK, forth coming)Google Scholar
  10. [Rac]
    Rackoff, C.: The covering and boundedness problems for VAS. Theor. Comp. Sc. 6, 223–231 (1978)Google Scholar
  11. [Sac]
    Sacerdote, G.S. and Tenney, R.L.: The decidability problem for VAS. 9th Ann. Symp. on Theory of Computing (1977)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Horst Müller
    • 1
  1. 1.Institut für Mathematische Maschinen und Datenverarbeitung III (Informatik)Universität Erlangen-NürnbergErlangenWest Germany

Personalised recommendations