Decidability of reachability in vector addition systems (Preliminary Version)

S. Rao Kosaraju
1982 Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82  
A convincing proof of the decidability of reachability in vector addition systems is presented. 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.
doi:10.1145/800070.802201 dblp:conf/stoc/Kosaraju82 fatcat:3j44cmqy5varnnzwr7p43ywody