LTL with the freeze quantifier and register automata

ACM Transactions on Computational Logic

Volumn 10, Issue 3, 2009, Pages

  Demri, Stéphane ^a   Lazić, Ranko ^b  

^a CNRS   (France)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Computational complexity; Expressiveness

Indexed keywords

ALTERNATING AUTOMATA; COUNTER AUTOMATA; EXPRESSIVENESS; FINITE ALPHABET; LINEAR TEMPORAL LOGIC; TEMPORAL OPERATORS; UNDECIDABILITY;

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

TEMPORAL LOGIC;

EID: 67249143974     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1507244.1507246     Document Type: Article

References (29)

1. ALU, R, R. AND HENZINGER, T. 1994. A really temporal logic. J. ACM 41, 1, 181-204
2. BOJAŃCZYK, M., MUSCHOLL, A., SCHWENTICK, T., SEGOUFIN, L., AND DAVID, C. 2006. Two-Variable logic on words with data. In Proceedings of the 21st IEEE Symposium on Logic in Computer Science (LICS) IEEE Computer Society, 7-16.
3. BOUAJJANI, A., HABERMEHL, P., JURSKI,Y., AND SIGHIREANU, M. 2007. Rewriting systems with data.In Proceedings of the 16th International Symposium on Fundamentals of Computer Theory (FCT).Lecture Notes in Computer Science, vol. 4639. Springer, 1-22.
4. DAVID, C. 2004. Mots et données infinies. M.S. thesis, Laboratoire d'Informatique Algorithmique: Fondements et Applications, Paris.
5. DEMRI, S., D'SOUZA,D., AND GASCON, R. 2007. A decidable temporal logic of repeating values. In Proceedings of the International Symposium on Logical Foundations of Computer Science (LFCS) Lecture Notes in Computer Science, vol. 4514. Springer, 180-194.
6. DEMRI,S. AND LAZIĆ, R. 2006. LTL with the freeze quantifier and register automata. In Proceedings of the 21st IEEE Symposium on Logic in Computer Science (LICS) IEEE Computer Society, 17-26.
7. DEMRI, S., LAZIĆ, R., AND NOWAK, D. 2007. On the freeze quantifier in Constraint LTL: Decidability and complexity. Inf. Comput. 205, 1, 2-24.
8. DEMRI, S., LAZIĆ, R., AND SANGNIER, A. 2008. Model checking freeze LTL over one-counter automata. In Proceedings of the 11th International Conference on Foundations of Software Science and Computer Structurers (FoSSaCS) Lecture Notes in Computer Science, vol. 4962. Springer, 490-504.
9. DICKSON, L. 1913. Finiteness of the odd perfect and primitive abundant numbers with distinct factors. Amer. J. Math. 35,413-422.
10. ETESSAMI, K., VARDI, M., AND WILKE, T. 2002. First-Order logic with two variables and unary temporal logic. Inf. Comput. 179, 2, 279-295.
11. FITTING, M. 2002. Modal logic between propositional and first-order. J. Logic Comput 12,6, 1017-1026.
12. FRENCH, T. 2003. Quantified propositional temporal logic with repeating states. In Proceedings of the 10th International Symposium on Temporal Representation and Reasoning/4th International Conference on Temporal Logic (TIME- ICTL) IEEE Computer Society, 155-165.
13. GORANKO, V. 1996. Hierarchies of modal and temporal logics with references pointers. J. Logic, Lang. Inf 5, 1-24.
14. KAMINSKI,M. AND FRANCEZ, N. 1994. Finite-Memory automata. Theor. Comput. Sci. 134, 2, 329-363.
15. KOSARAJU, S. R. 1982. Decidability of reachability in vector addition systems (preliminary version). In Proceedings of the 14th Annual ACM Symposium on Theory of Computing (STOC).ACM, 267-281.
16. LAZIĆ, R. 2006. Safely freezing LTL. In Proceedings of the 26th International Conference on Foundations of Software Technology and Theory in Computer Science (FSTTCS) Lecture Notes in Computer Science, vol. 4337. Springer, 381-392.
17. LIPTON, R. J. 1976. The reachability problem requires exponential space. Tech. rep. 62, Yale University
18. LISITSA,A. AND POTAPOV, I. 2005. Temporal logic with predicate γ-abstraction. In Proceedings of the12th International Symposium on Temporal Representation and Reasoning (TIME) IEEE Computer Society, 147-155.
19. MAYR, R. 2003. Undecidable problems in unreliable computations. Theor. Comput. Sci. 297, 1-3, 337-354.
20. MINSKY, M. 1967. Computation, Finite and Infinite Machines.Prentice Hall. MIYANO,S. AND HAYASHI, T. 1984. Alternating finite automata on ω-words. Theor. Comput. Sci. 32, 321-330.
21. MULLER, D. E., SAOUDI, A., AND SCHUPP, P. E. 1986. Alternating automata, the weak monadic theory of the tree, and its complexity. In Proceedings of the 13th International Colloquium on Automata, Languages, and Programming (ICALP).Lecture Notes in Computer Science, vol. 226. Springer, 275-283.
22. NEVEN, F., SCHWENTICK,T., AND VIANU, V. 2004. Finite state machines for strings over infinite alphabets. ACM Trans. Comput. Logic 5, 3, 403-435.
23. OUAKNINE,J. AND WORRELL, J. 2006a. On metric temporal logic and faulty Turing machines. In Proceedings ofthe 9th International Conference on Foundations ofSoftware Science and Computer Structures (FoSSaCS) Lecture Notes in Computer Science, vol. 3921. Springer, 217-230.
24. OUAKNINE,J. AND WORRELL, J. 2006b. Personal communication.
25. SAKAMOTO,H. AND IKEDA, D. 2000. Intractability of decision problems for finite-memory automata. Theor. Comput. Sci. 231,2, 297-308.
26. SCHNOEBELEN, P. 2002. Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett. 83, 5, 251-261.
27. SEGOUFIN, L. 2006. Automata and logics for words and trees over an infinite alphabet. In Proceedings of the 20th International Workshop on Computer Science Logic (CSL) Lecture Notes in Computer Science, vol. 4207. Springer, 41-57.
28. VARDI, M. Y. 1996. An automata-theoretic approach to linear temporal logic. In Banff Higher Order Works Lecture Notes in Computer Science, vol. 1043. Springer, 238-266.
29. WALUKIEWICZ, I. 2001. Pushdown processes: Games and model-checking. Inf. Comput. 164,2, 234-263.