Model checking freeze LTL over one-counter automata

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

Volumn 4962 LNCS, Issue , 2008, Pages 490-504

  Demri, Stéphane ^a   Lazić, Ranko ^c   Sangnier, Arnaud ^a,b  

^a CNRS   (France)

^b EDF R and D ^*

^c UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY ISSUES; COMPUTATIONAL STRUCTURES; COUNTER AUTOMATA; DETERMINISTIC ONE-COUNTER AUTOMATA; EUROPEAN; INTERNATIONAL (CO); MODEL CHECKING PROBLEMS; NON-TRIVIAL; PROPOSITIONAL VARIABLES; SOFTWARE SCIENCE;

AUTOMATA THEORY; FOUNDATIONS; ROBOTS; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 47249120473     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78499-9_34     Document Type: Conference Paper

References (30)

1. Alur, R., Dill, D.: A theory of timed automata. TCS 126, 183-235 (1994)
2. Alur, R., Henzinger, T.: A really temporal logic. In: FOCS 1989, pp. 164-169. IEEE, Los Alamitos (1989)
3. Bernholtz, O., Vardi, M., Wolper, P.: An automata-theoretic approach to branching-time model checking. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 142-155. Springer, Heidelberg (1994)
4. Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS 2006, pp. 10-19 (2006)
5. Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS 2006, pp. 7-16. IEEE, Los Alamitos (2006)
6. Bouajjani, A., Jurski, Y., Sighireanu, M.: A generic framework for reasoning about dynamic networks of infinite-state processes. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 690-705. Springer, Heidelberg (2007)
7. Bouyer, P., Petit, A., Thérien, D.: An algebraic approach to data languages and timed languages. I & C 182(2), 137-162 (2003)
8. Dang, Z., Ibarra, O., Pietro, P.S.: Liveness verification of reversal-bounded multicounter machines with a free counter. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol. 2245, pp. 132-143. Springer, Heidelberg (2001)
9. Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. In: LICS 2006, pp. 17-26. IEEE, Los Alamitos (2006)
10. Demri, S., Lazić, R., Nowak, D.: On the freeze quantifier in constraint LTL: Decidability and complexity. I & C 205(1), 2-24 (2007)
11. Demri, S., Lazić, R., Sangnier, A.: Model checking freeze LTL over one-counter automata. Research report, Laboratoire Spécification et Vérification, ENS Cachan (2008)
12. Franceschet, M., de Rijke, M.: Model checking hybrid logics (with an application to semistructured data). Journal of Applied Logic 4(3), 279-304 (2006)
13. Goranko, V.: Hierarchies of modal and temporal logics with references pointers. Journal of Logic, Language, and Information 5, 1-24 (1996)
14. Jančar, P., Kučera, A., Moller, F., Sawa, Z.: DP lower bounds for equivalence-checking and model-checking of one-counter automata. I & C 188(1), 1-19 (2004)
15. Jurdziński, M., Lazić, R.: Alternation-free modal mu-calculus for data trees. In: LICS 2007, pp. 131-140 (2007)
16. Kupferman, O., Vardi, M.: Memoryful Branching-Time Logic. In: LICS 2006, pp. 265-274. IEEE, Los Alamitos (2006)
17. Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. JACM 47(2), 312-360 (2000)
18. Laroussinie, F., Markey, N., Schnoebelen, P.: Temporal logic with forgettable past. In: LICS 2002, pp. 383-392. IEEE, Los Alamitos (2002)
19. Lazić, R.: Safely freezing LTL. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 381-392. Springer, Heidelberg (2006)
20. Markey, N., Schnoebelen, P.: Model checking a path. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 251-261. Springer, Heidelberg (2003)
21. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. TOCL 5(3), 403-435 (2004)
22. Ouaknine, J., Worrell, J.: On Metric Temporal Logic and faulty Turing machines. In: Aceto, L., Ingólfsdóttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 217-230. Springer, Heidelberg (2006)
23. Ouaknine, J., Worrell, J.: On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science 3(1:8), 1-27 (2007)
24. Schwentick, T., Weber, V.: Bounded-variable fragments of hybrid logics. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol. 4393, pp. 561-572. Springer, Heidelberg (2007)
25. Segoufin, L.: Automata and logics for words and trees over an infinite alphabet. In: Ésik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 41-57. Springer, Heidelberg (2006)
26. 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)
27. ten Cate, B., Franceschet, M.: On the complexity of hybrid logics with binders. In: Ong, L. (ed.) CSL 2005. LNCS, vol. 3634, pp. 339-354. Springer, Heidelberg (2005)
28. Vardi, M.: Alternating automata and program verification. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol. 1000, pp. 471-485. Springer, Heidelberg (1995)
29. Vardi, M.: Alternating automata: unifying truth and validity checking for temporal logics. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, pp. 191-206. Springer, Heidelberg (1997)
30. Vardi, M., Wolper, P.: Automata-theoretic techniques for modal logics of programs. JCSS 32, 183-221 (1986)