Vector addition system reachability problem: A short self-contained proof

ACM SIGPLAN Notices

Volumn 46, Issue 1, 2011, Pages 307-316

  Leroux, Jérôme ^a  

^a UNIVERSITÉ DE BORDEAUX   (France)

Author keywords

Petri; Presburger; Reachability; VAS

Indexed keywords

CENTRAL PROBLEMS; FINITE SEQUENCE; INITIAL CONFIGURATION; PETRI; PRESBURGER; PRESBURGER ARITHMETIC; REACHABILITY; REACHABILITY PROBLEM; SIMPLE ALGORITHM; VAS; VECTOR ADDITION SYSTEMS;

ALGORITHMS;

EID: 79251569009     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1925844.1926421     Document Type: Conference Paper

References (10)

1. [EN94] 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.
2. [GS66] Seymour Ginsburg and Edwin H. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics, 16(2):285-296, 1966.
3. [Hau90] Dirk Hauschildt. Semilinearity of the Reachability Set is Decidable for Petri Nets. PhD thesis, University of Hamburg, 1990.
4. [Kos82] 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.
5. [Lam92] Jean Luc Lambert. A structure to decide reachability in petri nets. Theoretical Computer Science, 99(1):79-104, 1992.
6. [Ler09] Jérôme Leroux. The general vector addition system reachability problem by Presburger inductive invariants. In LICS'09, pages 4-13, 2009.
7. [May81] ErnstW. 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.
8. [MM81] Ernst W. Mayr and Albert R. Meyer. The complexity of the finite containment problem for petri nets. J. ACM, 28(3):561-576, 1981.
9. [Sch87] Alexander Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, New York, 1987
10. [ST77] 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.