Model checking FO(R) over one-counter processes and beyond

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

Volumn 5771 LNCS, Issue , 2009, Pages 485-499

  To, Anthony Widjaja ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPONENTWISE; DATA COMPLEXITY; FIRST ORDER LOGIC; FIRST-ORDER; MODAL LOGIC; PRESBURGER ARITHMETIC; PROOF METHODS; PUSHDOWN PROCESS; QUANTIFIER ELIMINATION; REACHABILITY; SHARP CONTRAST; VARIABLE FRAGMENT;

COMPUTER SCIENCE; CRYSTAL LATTICES;

MODEL CHECKING;

EID: 70350383773     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04027-6_35     Document Type: Conference Paper

References (29)

1. Bekker, W., Goranko, V.: Symbolic model checking of tense logics on rational Kripke models. To appear in proceedings of ILC 2007 (2007)
2. Blumensath, A., Grädel, E.: Automatic structures. In: LICS 2000, pp. 51-62 (2000)
3. Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: Application to model-checking. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 135-150. Springer, Heidelberg (1997)
4. Compton, K.J., Henson, C.W.: A uniform method for proving lower bounds on the computational complexity of logical theories. Ann. Pure Appl. Logic 48(1), 1-79 (1990)
5. Esparza, J., Kucera, A., Schwoon, S.: Model checking LTL with regular valuations for pushdown systems. Inf. Comput. 186(2), 355-376 (2003)
6. Etessami, K., Vardi, M.Y.,Wilke, T.: First-order logic with two variables and unary temporal logic. Inf. Comput. 179(2), 279-295 (2002)
7. Ferrante, J., Rackoff, C.W.: The Computational Complexity of Logical Theories, vol. 718. Springer, Heidelberg (1979)
8. Göller, S., Mayr, R., To, A.W.: On the computational complexity of verifying onecounter processes. To appear in LICS 2009 (2009)
9. Grohe, M., Schweikardt, N.: The succinctness of first-order logic on linear orders.Logical Methods in Computer Science 1(1) (2005)
10. Jancar, P., Sawa, Z.: A note on emptiness for alternating finite automata with a one-letter alphabet. Inf. Process. Lett. 104(5), 164-167 (2007)
11. Jan?car, P., Ku?cera, A., Moller, F., Sawa, Z.: DP lower bounds for equivalencechecking and model-checking of one-counter automata. Inf. Comput. 188(1), 1-19 (2004)
12. Kozen, D.C.: Theory of Computation. Springer, Heidelberg (2006)
13. Krentel, M.W.: The complexity of optimization problems. J. Comput. Syst. Sci. 36(3), 490-509 (1988)
14. Ku?cera, A.: Efficient verification algorithms for one-counter processes. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 317-328. Springer, Heidelberg (2000)
15. Libkin, L.: Elements Of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2004)
16. Löding, C.: Reachability problems on regular ground tree rewriting graphs. Theory Comput. Syst. 39(2), 347-383 (2006)
17. Makowsky, J.A.: Algorithmic uses of the Feferman-Vaught Theorem. Ann. Pure Appl. Logic 126(1-3), 159-213 (2004)
18. Mayr, R.: Decidability of model checking with the temporal logic EF. Theor. Comput. Sci. 256(1-2), 31-62 (2001)
19. Morvan, C.: On rational graphs. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol. 1784, pp. 252-266. Springer, Heidelberg (2000)
20. Muller, D.E., Schupp, P.E.: The theory of ends, pushdown automata, and secondorder logic. Theor. Comput. Sci. 37, 51-75 (1985)
21. Péladeau, P.: Logically defined subsets of Nk. Theor. Comput. Sci. 93(2), 169-183 (1992)
22. Rabinovich, A.: On compositionality and its limitations. ACM Trans. Comput. Logic 8(1), 4 (2007)
23. Serre, O.: Parity games played on transition graphs of one-counter processes. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 337-351. Springer, Heidelberg (2006)
24. Stockmeyer, L.J.: The complexity of decision problems in automata theory and logic. PhD thesis, Department of Electrical Engineering, MIT (1974)
25. Thomas, W.: Constructing infinite graphs with a decidable MSO-theory. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 113-124. Springer, Heidelberg (2003)
26. To, A.W., Libkin, L.: Recurrent reachability analysis in regular model checking. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 198-213. Springer, Heidelberg (2008)
27. Walukiewicz, I.: Model checking CTL properties of pushdown systems. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol. 1974, pp. 127-138. Springer, Heidelberg (2000)
28. Walukiewicz, I.: Pushdown processes: games and model-checking. Inf. Comput. 164(2), 234-263 (2001)
29. Wöhrle, S., Thomas, W.: Model checking synchronized products of infinite transition systems. Logical Methods in Computer Science 3(4) (2007)