Vector Addition Systems Reachability Problem (A Simpler Solution)
暂无分享,去创建一个
[1] S. Ginsburg,et al. Semigroups, Presburger formulas, and languages. , 1966 .
[2] Jean-Luc Lambert,et al. A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..
[3] Ernst W. Mayr. An Algorithm for the General Petri Net Reachability Problem , 1984, SIAM J. Comput..
[4] Jérôme Leroux. The General Vector Addition System Reachability Problem by Presburger Inductive Invariants , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.
[5] Mogens Nielsen,et al. Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.
[6] John E. Hopcroft,et al. On the Reachability Problem for 5-Dimensional Vector Addition Systems , 1976, Theor. Comput. Sci..
[7] Petr Jancar,et al. Decidability of a Temporal Logic Problem for Petri Nets , 1990, Theor. Comput. Sci..
[8] Petr Jancar,et al. Bouziane's transformation of the Petri net reachability problem and incorrectness of the related algorithm , 2008, Inf. Comput..
[9] S. Rao Kosaraju,et al. Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.
[10] Albert R. Meyer,et al. The Complexity of the Finite Containment Problem for Petri Nets , 1981, JACM.
[11] David K. Smith. Theory of Linear and Integer Programming , 1987 .
[12] Jérôme Leroux,et al. Vector addition system reachability problem: a short self-contained proof , 2011, POPL '11.
[13] Richard L. Tenney,et al. The decidability of the reachability problem for vector addition systems (Preliminary Version) , 1977, STOC '77.
[14] Zakaria Bouziane,et al. A primitive recursive algorithm for the general Petri net reachability problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).