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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Hack, M.: The equality problem for vector addition systems is undecidable. Theor. Computer Sci. 2 (1976), 77–96
Hopcroft, J. and Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Computer Sci. 8 (1979), 135–159
Jones, N.D.; Landweber, L.H. and Lien, Y.E.: Complexity of some problems in Petri nets. Theor. Computer Sci. 4 (1977), 277–299
Karp, R.M. and Miller, R.E.: Parallel program schemata. J. Comput. System Sci. 3 (1969), 147–195
Landweber, L.H. and Robertson, E.L.: Properties of conflict-free and persistent Petri nets. J. Ass. Computing Machinery 25 (1978), 352–364
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–309
Machtey, M. and Young, P.: An introduction to the general theory of algorithms. North Holland, New York (1978)
Müller, H.: On the reachability problem for persistent vector replacement systems (to appear)
Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comp. Sci. 6 (1978), 223–231
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–77
Starke, H.P.: Semilinearity and Petri nets. Fundamentals of computation theory 79 (Ed. L. Budach), Akademie-Verlag Berlin (1979), 423–429
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1980 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller, H. (1980). Decidability of reachability in persistent vector replacement systems. In: Dembiński, P. (eds) Mathematical Foundations of Computer Science 1980. MFCS 1980. Lecture Notes in Computer Science, vol 88. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022522
Download citation
DOI: https://doi.org/10.1007/BFb0022522
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10027-0
Online ISBN: 978-3-540-38194-5
eBook Packages: Springer Book Archive