Model checking memoryful linear-time logics over one-counter automata

Theoretical Computer Science

Volumn 411, Issue 22-24, 2010, Pages 2298-2316

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

^a UNIVERSITÉ PARIS SACLAY   (France)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c CNRS   (France)

Author keywords

Computational complexity; First order logic; One counter automaton; Temporal logic

Indexed keywords

CONTROL STATE; COUNTER AUTOMATA; DETERMINISTIC ONE-COUNTER AUTOMATA; FIRST ORDER LOGIC; LOW COMPLEXITY; MODEL CHECKING PROBLEM; ONE-COUNTER AUTOMATON; OPERATIONAL MODEL; PROPOSITIONAL VARIABLES; REVERSAL-BOUNDED COUNTERS; SATISFIABILITY PROBLEMS; VERIFICATION PROBLEMS;

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; ROBOTS; TEMPORAL LOGIC; TRANSLATION (LANGUAGES);

MODEL CHECKING;

EID: 77950857797     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.02.021     Document Type: Article

References (33)

1. Minsky M. Computation, Finite and Infinite Machines (1967), Prentice Hall
2. Alur R., and Dill D. A theory of timed automata. Theoretical Computer Science 126 (1994) 183-235
3. Björklund H., and Bojanczyk M. Shuffle expressions and words with nested data. MFCS'07. Lecture Notes in Computer Science vol. 4708 (2007), Springer 750-761
4. Bojańczyk M., Muscholl A., Schwentick T., and Segoufin L. Two-variable logic on data trees and XML reasoning. Journal of the ACM 56 3 (2009)
5. Björklund H., and Bojańczyk M. Bounded depth data trees. ICALP'07. Lecture Notes in Computer Science vol. 4596 (2007), Springer 862-874
6. Jurdziński M., and Lazić R. Alternation-free modal mu-calculus for data trees. LICS'07 (2007), IEEE 131-140
7. Bojańczyk M., Muscholl A., Schwentick T., Segoufin L., and David C. Two-variable logic on words with data. LICS'06 (2006), IEEE 7-16
8. Demri S., and Lazić R. LTL with the freeze quantifier and register automata. ACM Transactions on Computational Logic 10 3 (2009)
9. Laroussinie F., Markey N., and Schnoebelen P. Temporal logic with forgettable past. LICS'02 (2002), IEEE 383-392
10. Kupferman O., and Vardi M. Memoryful branching-time logic. LICS'06 (2006), IEEE 265-274
11. C. David, Mots et données infinies, Master's Thesis, LIAFA, 2004, 45 pages (in French).
12. Demri S., Lazić R., and Nowak D. On the freeze quantifier in constraint LTL: decidability and complexity. Information & Computation 205 1 (2007) 2-24
13. Lazić R. Safely freezing LTL. FST&TCS'06. Lecture Notes in Computer Science vol. 4337 (2006) 381-392
14. Ouaknine J., and Worrell J. On metric temporal logic and faulty Turing machines. FOSSACS'06. Lecture Notes in Computer Science vol. 3921 (2006), Springer 217-230
15. Ouaknine J., and Worrell J. On the decidability and complexity of metric temporal logic over finite words. Logical Methods in Computer Science 3 1:8 (2007) 1-27
16. Bouyer P., Petit A., and Thérien D. An algebraic approach to data languages and timed languages. Information & Computation 182 2 (2003) 137-162
17. Neven F., Schwentick T., and Vianu V. Finite state machines for strings over infinite alphabets. ACM Transactions on Computational Logic 5 3 (2004) 403-435
18. Segoufin L. Automata and logics for words and trees over an infinite alphabet. CSL'06. Lecture Notes in Computer Science vol. 4207 (2006), Springer 41-57
19. Björklund H., and Schwentick T. On notions of regularity for data languages. FCT'07. Lecture Notes in Computer Science vol. 4639 (2007), Springer 88-99
20. Alur R., and Henzinger T. A really temporal logic. FOCS'89 (1989), IEEE 164-169
21. Goranko V. Hierarchies of modal and temporal logics with references pointers. Journal of Logic, Language, and Information 5 (1996) 1-24
22. Schwentick T., and Weber V. Bounded-variable fragments of hybrid logics. STACS'07. Lecture Notes in Computer Science vol. 4393 (2007), Springer 561-572
23. Franceschet M., de Rijke M., and Schlingloff B.-H. Hybrid logics on linear structures: expressivity and complexity. TIME-ICTL 2003 (2003), IEEE 164-171
24. Franceschet M., and de Rijke M. Model checking hybrid logics (with an application to semistructured data). Journal of Applied Logic 4 3 (2006) 279-304
25. ten Cate B., and Franceschet M. On the complexity of hybrid logics with binders. CSL'05. Lecture Notes in Computer Science vol. 3634 (2005), Springer 339-354
26. Markey N., and Schnoebelen P. Model checking a path. CONCUR'03. Lecture Notes in Computer Science vol. 2761 (2003), Springer 251-261
27. Jančar P., Kučera A., Moller F., and Sawa Z. DP lower bounds for equivalence-checking and model-checking of one-counter automata. Information & Computation 188 1 (2004) 1-19
28. Serre O. Parity games played on transition graphs of one-counter processes. FOSSACS'06. Lecture Notes in Computer Science vol. 3921 (2006), Springer 337-351
29. Demri S., and Gascon R. The effects of bounding syntactic resources on Presburger LTL (extended abstract). TIME'07 (2007), IEEE 94-104
30. Demri S., Lazić R., and Sangnier A. Model checking freeze LTL over one-counter automata. FOSSACS'08. Lecture Notes in Computer Science vol. 4692 (2008), Springer 490-504 See also the technical report LSV-08-11, LSV (ENS Cachan)
31. Gabbay D.M. Expressive functional completeness in tense logic. Aspects of Philosophical Logic (1981), Reidel 91-117
32. Ibarra O. Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25 1 (1978) 116-133
33. Demri S., and Sangnier A. When model checking freeze LTL over counter machines becomes decidable. FOSSACS'10. Lecture Notes in Computer Science vol. 6014 (2010), Springer 176-190