论文信息 - Decidability of reachability in vector addition systems (Preliminary Version)

Decidability of reachability in vector addition systems (Preliminary Version)

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.

S. Rao Kosaraju | S. Kosaraju | Perliminary Version

[1] Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..

[2] Frank Harary,et al. Graph Theory , 2016 .

[3] Richard L. Tenney,et al. The decidability of the reachability problem for vector addition systems (Preliminary Version) , 1977, STOC '77.

[4] Seymour Ginsburg,et al. The mathematical theory of context free languages , 1966 .

[5] Jan van Leeuwen. A partial solution to the reachability-problem for vector-addition systems , 1974, STOC '74.

[6] John E. Hopcroft,et al. On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..