An algorithm constructing the semilinear post* for 2-dim reset/transfer VASS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1893, Issue , 2000, Pages 353-362

  Finkel, A ^a   Sutre, G ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PETRI NETS; PUBLIC KEY CRYPTOGRAPHY; VECTORS;

BOUNDEDNESS; COVERABILITY TREES; MILLER'S ALGORITHM; REACHABILITY; REACHABILITY SET; SEMI-LINEAR SETS; SEMILINEAR; VECTOR ADDITION SYSTEMS;

TREES (MATHEMATICS);

EID: 84959187813     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_31     Document Type: Conference Paper

References (9)

1. A. Bouajjani and R. Mayr. Model checking lossy vector addition systems. In Proc. 16th Ann. Symp. Theoretical Aspects of Computer Science (STACS'99), Trier, Germany, Mar. 1999 volume 1563 of Lecture Notes in Computer Science, pages 323-333. Springer, 1999.
2. C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset nets between decidability and undecidability. In Proc. 25th Int. Coll. Automata, Languages, and Programming (ICALP'98), Aalborg, Denmark, July 1998, volume 1443 of Lecture Notes in Computer Science, pages 103-115. Springer, 1998.
3. C. Dufourd, P. Jancar, and Ph. Schnoebelen. Boundedness of Reset P/T nets. In Proc. 26th Int. Coll. Automata, Languages, and Programming (ICALP'99), Prague, Czech Republic, July 1999, volume 1644 of Lecture Notes in Computer Science, pages 301-310. Springer, 1999.
4. A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144-179, 1990.
5. A. Finkel and G. Sutre. Decidability of reachability problems for classes of two counters automata. In Proc. 17th Ann. Symp. Theoretical Aspects of Computer Science (STACS'2000), Lille, France, Feb. 2000, volume 1770 of Lecture Notes in Computer Science, pages 346-357. Springer, 2000.
6. A. Finkel and G. Sutre. Verification of two counters automata. Research Report LSV-2000-7, Lab. Specification and Verification, ENS de Cachan, Cachan, France, June 2000.
7. J. Hopcroft and J. J. Pansiot. On the reachability problem for 5-dimensional vector addition systems. Theoretical Computer Science, 8:135-159, 1979.
8. S. R. Kosaraju. Decidability of reachability in vector addition systems. In Proc. 14th ACM Symp. Theory of Computing (STOC'82), San Francisco, CA, May 1982, pages 267-281, 1982.
9. E. W. Mayr. An algorithm for the general Petri net reachability problem. SIAM J. Comput., 13(3):441-460, 1984.