Reachability in succinct and parametric one-counter automata

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

Volumn 5710 LNCS, Issue , 2009, Pages 369-383

  Haase, Christoph ^a   Kreutzer, Stephan ^a   Ouaknine, Joël ^a   Worrell, James ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COUNTER AUTOMATA; FINAL STATE; INFINITE STATE SYSTEMS; INITIAL STATE; NP COMPLETE; NP-HARD; PRESBURGER ARITHMETIC; REACHABILITY; REACHABILITY PROBLEM;

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; ROBOTS; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 70349854914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04081-8_25     Document Type: Conference Paper

References (20)

1. Abdulla, P.A., Cerans, K.: Simulation is decidable for one-counter nets. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol.1466, pp. 253- 268. Springer, Heidelberg (1998)
2. Alur, R., Henzinger, T.A., Vardi, M.Y.: Parametric real-time reasoning. In: Proc. STOC 1993, pp. 592-601. ACM, New York (1993)
3. Bouajjani, A., Bozga, M., Habermehl, P., Iosif, R., Moro, P., Vojnar, T.: Programs with lists are counter automata. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol.4144, pp. 517-531. Springer, Heidelberg (2006)
4. Bozga, M., Iosif, R., Lakhnech, Y.: Flat parametric counter automata. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.4052, pp. 577-588. Springer, Heidelberg (2006)
5. Comon, H., Jurski, Y.: Multiple counters automata, safety analysis and presburger arithmetic. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol.1427. Springer, Heidelberg (1998)
6. Cormen, T., Leiserson, C., Rivest, R.: Introduction to algorithms. MIT Press and McGraw-Hill (1990)
7. Demri, S.: Logiques pour la spècification et vèrification. Mèmoire d'habilitation, Universitè Paris 7 (2007)
8. Demri, S., Gascon, R.: The effects of bounding syntactic resources on Presburger LTL. In: Proc. TIME 2007. IEEE Computer Society Press, Los Alamitos (2007)
9. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
10. Ibarra, O.H., Dang, Z.: On two-way finite automata with monotonic counters and quadratic diophantine equations. Theor. Comput. Sci. 312(2-3), 359-378 (2004)
11. Ibarra, O.H., Dang, Z.: On the solvability of a class of diophantine equations and applications. Theor. Comput. Sci. 352(1), 342-346 (2006)
12. Ibarra, O.H., Jiang, T., Trân, N.,Wang, H.: New decidability results concerning twoway counter machines and applications. In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.700, pp. 313-324. Springer, Heidelberg (1993)
13. Janicar, P., Kuicera, A., Moller, F., Sawa, Z.: DP lower bounds for equivalencechecking and model-checking of one-counter automata. Information Computation 188(1), 1-19 (2004)
14. Kuicera, A.: effcient verification algorithms for one-counter processes. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.1853, p. 317. Springer, Heidelberg (2000)
15. Lafourcade, P., Lugiez, D., Treinen, R.: Intruder deduction for AC-like equational theories with homomorphisms. In: Research Report LSV-04-16. LSV, ENS de Cachan (2004)
16. Leroux, J., Sutre, G.: Flat counter automata almost everywhere! In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.3707, pp. 489-503. Springer, Heidelberg (2005)
17. Lipshitz, L.: The diophantine problem for addition and divisibility. Transaction of the American Mathematical Society 235, 271-283 (1976)
18. Mayr, E.W.: An algorithm for the general petri net reachability problem. In: Proc. STOC 1981, pp. 238-246. ACM, New York (1981)
19. Minsky, M.: Recursive unsolvability of post's problem of "tag" and other topics in theory of turing machines. Annals of Math. 74(3) (1961)
20. Xie, G., Dang, Z., Ibarra, O.H.: A solvable class of quadratic diophantine equations with applications to verification of infinite-state systems. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.2719, pp. 668-680. Springer, Heidelberg (2003)