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.
No takes yet. Share an insight, caveat, or question.
S. Rao Kosaraju (1982) studied this question.
Synapse has enriched 2 closely related papers on similar clinical questions. Consider them for comparative context: