Decidability of reachability in persistent vector replacement systems
- 9 June 2005
- book chapter
- Published by Springer Nature
- p. 426-438
- https://doi.org/10.1007/bfb0022522
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- On the reachability problem for 5-dimensional vector addition systemsTheoretical Computer Science, 1979
- Properties of Conflict-Free and Persistent Petri NetsJournal of the ACM, 1978
- The covering and boundedness problems for vector addition systemsTheoretical Computer Science, 1978
- Complexity of some problems in Petri netsTheoretical Computer Science, 1977
- The decidability of the reachability problem for vector addition systems (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1977
- The equality problem for vector addition systems is undecidableTheoretical Computer Science, 1976
- A partial solution to the reachability-problem for vector-addition systemsPublished by Association for Computing Machinery (ACM) ,1974
- Parallel program schemataJournal of Computer and System Sciences, 1969