Abstract
On the Reachability Problem for Persistent Vector Replacement Systems. 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.
Zusammenfassung
Das Erreichbarkeitsproblem für persistente Vektor-Ersetzungs-Systeme. Das Erreichbarkeitsproblem für persistente Vektor-Ersetzungs-Systeme (isomorph zu verallgemeinerten Petri-Netzen) wird als entscheidbar nachgewiesen durch Konstruktion eines Algorithmus, der eine semilineare Darstellung der, Erreichbarkeitsmenge liefert.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hack, M.: The equality problem for vector addition systems is undecidable. Theor. Computer Sei. 2, 77–96 (1976).
Hopcroft, J., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theor. Computer Science 8, 135–159 (1979).
Jones, N. D., Landweber, L. H., Lien, Y. E.: Complexity of some problems in Petri nets. Theor. Computer Science 4, 277–299 (1977).
Karp, R. M., Miller, R. E.: Parallel program Schemata. J. Comput. System Sei. 3,147–195 (1969).
Landweber, L. H., Robertson, E. L.: Properties of conflict-free and persistent Petri nets. J. Ass. Computing Machinery 25, 352–364 (1978).
van Leeuwen, J.: A partial Solution to the reachability problem for vector addition systems. 6th Ann. ACM Symp. on the Theory of Computing, pp. 303–309 (1974).
Machtey, M., Young, P.: An introduetion to the general theory of algorithms. New York: North- Holland 1978.
Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comp. Sei. 6, 223–231 (1978).
Sacerdote, G. S., Tenney, R. L.: The decidability of the reachability problem for vector addition systems. 9th Ann. ACM Symp. on Theory of Computing, pp. 61–77 (1977).
Starke, H. P.: Semilinearity and Petri nets. Fundamentals of Computation Theory 79 (Budach, L., ed.), pp. 423–429. Berlin: Akademie-Verlag 1979.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1981 Springer-Verlag
About this chapter
Cite this chapter
Müller, H. (1981). On the Reachability Problem for Persistent Vector Replacement Systems. In: Knödel, W., Schneider, H.J. (eds) Parallel Processes and Related Automata / Parallele Prozesse und damit zusammenhängende Automaten. Computing Supplementum, vol 3. Springer, Vienna. https://doi.org/10.1007/978-3-7091-8596-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-7091-8596-4_6
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-81606-6
Online ISBN: 978-3-7091-8596-4
eBook Packages: Springer Book Archive