Abstract
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition (KLMTS decomposition). Recently from this decomposition, we deduced that a final configuration is not reachable from an initial one if and only if there exists a Presburger inductive invariant that contains the initial configuration but not the final one. Since we can decide if a Preburger formula denotes an inductive invariant, we deduce from this result that there exist checkable certificates of non-reachability in the Presburger arithmetic. In particular, there exists a simple algorithm for deciding the general VAS reachability problem based on two semi-algorithms. A first one that tries to prove the reachability by enumerating finite sequences of actions and a second one that tries to prove the non-reachability by enumerating Presburger formulas. In this paper we provide the first proof of the VAS reachability problem that is not based on the KLMST decomposition. The proof is based on the notion of production relations inspired from Hauschildt that directly provides the existence of Presburger inductive invariants.
Supplemental Material
- J. Esparza and M. Nielsen. Decidability issues for petri nets - a survey. Bulletin of the European Association for Theoretical Computer Science, 52:245--262, 1994.Google Scholar
- Seymour Ginsburg and Edwin H. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics, 16(2):285--296, 1966.Google Scholar
Cross Ref
- Dirk Hauschildt. Semilinearity of the Reachability Set is Decidable for Petri Nets. PhD thesis, University of Hamburg, 1990.Google Scholar
- S. Rao Kosaraju. Decidability of reachability in vector addition systems (preliminary version). In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, (STOC 1982), 5-7 May 1982, San Francisco, California, USA, pages 267--281. ACM, 1982. Google Scholar
Digital Library
- Jean Luc Lambert. A structure to decide reachability in petri nets. Theoretical Computer Science, 99(1):79--104, 1992. Google Scholar
Digital Library
- Jérôme Leroux. The general vector addition system reachability problem by Presburger inductive invariants. In LICS'09, pages 4--13, 2009. Google Scholar
Digital Library
- Ernst W. Mayr. An algorithm for the general petri net reachability problem. In Conference Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computation, (STOC 1981), 11-13 May 1981, Milwaukee, Wisconsin, USA, pages 238--246. ACM, 1981. Google Scholar
Digital Library
- Ernst W. Mayr and Albert R. Meyer. The complexity of the finite containment problem for petri nets. J. ACM, 28(3):561--576, 1981. Google Scholar
Digital Library
- Alexander Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, New York, 1987. Google Scholar
Digital Library
- George S. Sacerdote and Richard L. Tenney. The decidability of the reachability problem for vector addition systems (preliminary version). In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, 2-4 May 1977, Boulder, Colorado, USA, pages 61--76. ACM, 1977. Google Scholar
Digital Library
Index Terms
Vector addition system reachability problem: a short self-contained proof
Recommendations
Vector addition system reachability problem: a short self-contained proof
POPL '11: Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languagesThe reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition (KLMTS ...
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
LICS '09: Proceedings of the 2009 24th Annual IEEE Symposium on Logic In Computer ScienceThe reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition. This ...
Presburger Vector Addition Systems
LICS '13: Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer ScienceThe reach ability problem for Vector Addition Systems (VAS) is a central problem of net theory. The problem is known to be decidable by inductive invariants definable in the Presburger arithmetic. When the reach ability set is definable in the ...







Comments