Decidability of reachability problems for classes of two counters automata

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

Volumn 1770, Issue , 2000, Pages 346-357

  Finkel, Alain ^a   Sutre, Grégoire ^a  

^a CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; FORESTRY; STABILITY; TREES (MATHEMATICS);

COUNTER AUTOMATA; FOLLOWING OPERATION; REACHABILITY PROBLEM; REACHABILITY SET; SEMI-LINEAR SETS; SEMILINEAR; STABILITY PROPERTIES; SYMBOLIC REACHABILITY;

AUTOMATA THEORY;

EID: 84944068512     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-46541-3_29     Document Type: Article

References (14)

1. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. 8th Int. Conf. Concurrency Theory (CONCUR'97), Warsaw, Poland, Jul. 1997, volume 1243 of Lecture Notes in Computer Science, pages 135-150. Springer, 1997.
2. M. Benois and J. Sakarovitch. On the complexity of some extended word problems defined by cancellation rules. Information Processing Letters, 23(6):281-287, 1986.
3. D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1):61-86, 1992.
4. G. Céecée and A. Finkel. Programs with quasi-stable channels are effectively recognizable. In Proc. of the 9th Conference on Computer-Aided Verification (CAV), volume 1254, pages 304-315. LNCS, June 1997.
5. G. Cécé, A. Finkel, and I. S. Purushothaman. Unreliable channels are easier to verify than perfect channels. Information and Computation, 124(1):20-31, 1996.
6. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and Presburger arithmetic. In Proc. 10th Int. Conf. Computer Aided Verification (CAV'98), Vancouver, BC, Canada, June-July 1998, volume 1427 of Lecture Notes in Computer Science, pages 268-279. Springer, 1998.
7. 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.
8. C. Dufourd, P. Jančar, 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.
9. C. Dufourd. Réseaux de Petri avec reset/transfert: Décidabilité et indécidabilité. Thèse de Docteur en Sciences de l'École Normale Supérieure de Cachan, October 1998.
10. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems. Electronic Notes in Theoretical Computer Science, 9, 1997.
11. J. Hopcroft and J. J. Pansiot. On the reachability problem for 5- dimensional vector addition systems. Theoretical Computer Science, 8:135-159, 1979.
12. R. R. Howell, L. E. Rosier, D. T. Huynh, and H-C. Yen. Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states. Theoretical Computer Science, 46:107-140, 1986.
13. R. M. Karp and R. E. Miller. Parallel program schemata. Journal of Computer and System Sciences, 3(2):147-195, 1969.
14. K. Reinhardt. Reachability in Petrinets with inhibitor arcs, November 1995. Unpublished manuscript. See www-fs.informatik.uni-tuebingen.de/~reinhard.