论文信息 - Vector Addition System Reversible Reachability Problem

Vector Addition System Reversible Reachability Problem

The reachability problem for vector addition systems is a central problem of net theory. This problem is known to be decidable but the complexity is still unknown. Whereas the problem is EXPSPACE-hard, no elementary upper bounds complexity are known. In this paper we consider the reversible reachability problem. This problem consists to decide if two configurations are reachable one from each other. We show that this problem is EXPSPACE-complete. As an application of the introduced materials we characterize the reversibility domains of a vector addition system.

Jérôme Leroux

[1] S. Rao Kosaraju,et al. Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

[2] Charles Rackoff,et al. The Covering and Boundedness Problems for Vector Addition Systems , 1978, Theor. Comput. Sci..

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

[4] Mogens Nielsen,et al. Decidability Issues for Petri Nets - a survey , 1994, Bull. EATCS.

[5] Alain Finkel,et al. Cyclic Petri net reachability sets are semi-linear effectively constructible , 1997, INFINITY.

[6] Dirk Hauschildt. Semilinearity of the reachability set is decidable for Petri nets , 1990 .

[7] Jean-Luc Lambert,et al. A Structure to Decide Reachability in Petri Nets , 1992, Theor. Comput. Sci..

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

[9] Richard J. Lipton,et al. Exponential space complete problems for Petri nets and commutative semigroups (Preliminary Report) , 1976, STOC '76.

[10] Loïc Pottier. Minimal Solutions of Linear Diophantine Systems: Bounds and Algorithms , 1991, RTA.

[11] Jérôme Leroux,et al. Vector addition system reachability problem: a short self-contained proof , 2011, POPL '11.