The general vector addition system reachability problem by presburger inductive invariants

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2009, Pages 4-13

  Leroux, JéRôme ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

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

COMPUTABILITY AND DECIDABILITY; COMPUTER SCIENCE;

SET THEORY;

EID: 70350610958     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2009.10     Document Type: Conference Paper

References (10)

1. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In E. A. Emerson and A. P. Sistla, editors, Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000, Proceedings, volume 1855 of Lecture Notes in Computer Science, pages 154-169. Springer, 2000.
2. 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.
3. S. Ginsburg and E. H. Spanier. Semigroups, Presburger formulas and languages. Pacific Journal of Mathematics, 16(2):285-296, 1966.
4. J. E. Hopcroft and J.-J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoritical Computer Science, 8:135-159, 1979.
5. S. R. 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.
6. J. L. Lambert. A structure to decide reachability in petri nets. Theoretical Computer Science, 99(1):79-104, 1992.
7. E. 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.
8. E. W. Mayr and A. R. Meyer. The complexity of the finite containment problem for petri nets. J. ACM, 28(3):561-576, 1981.
9. C. Rackoff. The covering and boundedness problems for vector addition systems. Theoretical Computer Science, 6(2), 1978.
10. G. S. Sacerdote and R. 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.