Decidability of reachability in vector addition systems (preliminary version (1982)
by
S. Ran Kosaraju
| Venue: | In STOC |
| Citations: | 72 - 0 self |
BibTeX
@INPROCEEDINGS{Kosaraju82decidabilityof,
author = {S. Ran Kosaraju},
title = {Decidability of reachability in vector addition systems (preliminary version},
booktitle = {In STOC},
year = {1982},
pages = {267--281},
publisher = {ACM}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
A convincing proof of the decidability of reachability is presented. in vector addition systems No drastically new ideas beyond those in Sacerdote and Tenney, and Mayr are made use of. The complicated tree constructions in the earlier proofs are completely eliminated. I.
Citations
| 132 | An algorithm for the general Petri net reachability problem - Mayr - 1984 |
| 38 | On the reachability problem for 5-dimensional vector addition systems - Hopcroft, Pansiot - 1979 |
| 20 | Graph Theory, Addison-Wesley Publishing Co - Harary - 1972 |
| 7 | The decidability of the reachability problem for vector addition systems - Sacerdote, Tenney - 1977 |
| 5 | A partial solution to the reachability problem for vector-addition systems, Proc. of the 6th Annual ACM SYmP. on Theory of Computing - Leeuwen - 1974 |
| 1 | for chians of - Ginsburg, S - 1966 |
| 1 | L.: Vector Addition Systems - Sacerdote, Tenney |
