Advertisement

Decidability of reachability in persistent vector replacement systems

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

Abstract

The reachability problem for persistent vector replacement systems is shown to be decidable by giving an algorithm for constructing a semilinear representation of the reachability set.

Keywords

Initial Segment Initial Vector Reachability Problem Infinite Path Finite Tree 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Hack, M.: The equality problem for vector addition systems is undecidable. Theor. Computer Sci. 2 (1976), 77–96Google Scholar
  2. [2]
    Hopcroft, J. and Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Computer Sci. 8 (1979), 135–159Google Scholar
  3. [3]
    Jones, N.D.; Landweber, L.H. and Lien, Y.E.: Complexity of some problems in Petri nets. Theor. Computer Sci. 4 (1977), 277–299Google Scholar
  4. [4]
    Karp, R.M. and Miller, R.E.: Parallel program schemata. J. Comput. System Sci. 3 (1969), 147–195Google Scholar
  5. [5]
    Landweber, L.H. and Robertson, E.L.: Properties of conflict-free and persistent Petri nets. J. Ass. Computing Machinery 25 (1978), 352–364Google Scholar
  6. [6]
    Van Leeuwen, J.: A partial solution to the reachability problem for vector addition systems. Sixth Ann. ACM Symp. on the Theory of Computing (1974), 303–309Google Scholar
  7. [7]
    Machtey, M. and Young, P.: An introduction to the general theory of algorithms. North Holland, New York (1978)Google Scholar
  8. [8]
    Müller, H.: On the reachability problem for persistent vector replacement systems (to appear)Google Scholar
  9. [9]
    Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comp. Sci. 6 (1978), 223–231Google Scholar
  10. [10]
    Sacerdote, G.S. and Tenney, R.L.: The decidability of the reachability problem for vector addition systems. 9th Ann. ACM Symp. on theory of computing (1977), 61–77Google Scholar
  11. [11]
    Starke, H.P.: Semilinearity and Petri nets. Fundamentals of computation theory 79 (Ed. L. Budach), Akademie-Verlag Berlin (1979), 423–429Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

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

Personalised recommendations