On the freeze quantifier in Constraint LTL: Decidability and complexity

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn , Issue , 2005, Pages 113-121

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

^a INRIA   (France)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINDING MECHANISMS; COMPLEXITY RESULTS; FIRST-ORDER TEMPORAL LOGIC; HYBRID LOGIC; LOGICAL LANGUAGE; OPERATIONAL MODEL; PRESBURGER; REAL-TIME LOGIC; SEQUENCE DIAGRAMS; UNDECIDABILITY;

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; FORMAL LANGUAGES; LINGUISTICS; TEMPORAL LOGIC;

QUERY LANGUAGES;

EID: 33746658207     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2005.28     Document Type: Conference Paper

References (37)

1. R. Alur and D. Dill. A theory of timed automata. TCS, 126:183-235, 1994.
2. R. Alur and T. Henzinger. A really temporal logic. JACM, 41(1):181-204, 1994.
3. C. Areces, P. Blackburn, and M. Marx. A road-map on complexity for hybrid logics. In CSL'99, volume 1683 of LNCS, pages 307-321, 1999.
4. P. Balbiani and J. Condotta. Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. In FroCoS'02, volume 2309 of LNAI, pages 162-173, 2002.
5. B. Boigelot. Symbolic methods for exploring infinite state spaces. PhD thesis, Université de Liège, 1998.
6. B. Boigelot and P. Wolper. Representing arithmetic constraints with finite automata: an overview. In ICLP 2002, volume 2401 of LNCS, pages 1-19, 2002.
7. M. Bojańczyk, C. David, A. Muscholl, T. Schwentick, and L. Segoufin. Two-variable logic on words with data. 2005. Submitted.
8. A. Bouajjani, R. Echahed, and P. Habermehl. On the verification problem of nonregular properties for nonregular processes. In LICS'95, pages 123-133, 1995.
9. P. Bouyer. A logical characterization of data languages. IPL, 84(2):75-85, 2002.
10. P. Bouyer, A. Petit, and D. Théien. An algebraic approach to data languages and timed languages. I & C, 182(2):137-162, 2003.
11. T. Brihaye, V. Bruyère, and J. Raskin. Model-checking for weighted timed automata. In FO RMATS'04, volume 3253 of LNCS, pages 277-292, 2004.
12. S. M. Cho, H. H. Kim, S. D. Cha, and D. H. Bae. A semantics of sequence diagrams. IPL, 84:125-130, 2002.
13. H. Comon and V. Cortier. Flatness is not a weakness. In CSL'00, volume 1862 of LNCS, pages 262-276, 2000.
14. C. David. Mots et données infinies. Master's thesis, LIAFA, 2004. 45 pages.
15. Rde Boer and R. van Eijk. Decidable navigation logics for object structures. In CSL'01, volume 2142 of LNCS, pages 324-338, 2001.
16. A. Degtyarev, M. Fisher, and A. Lisitsa. Equality and monodic first-order temporal logic. Studia Logica, 72:147-156, 2002.
17. S. Demri. LTL over integer periodicity constraints. Technical Report LSV-04-6, LSV, February 2004. 35 pages. An extended abstract appeared in Proc. of FOSSACS'04.
18. S. Demri and D. D'Souza. An automata-theoretic approach to constraint LTL. Technical Report LSV-03-11, LSV, 2003. 40 pages. An extended abstract appeared in Proc. of FSTTCS'02.
19. S. Demri, R. Lazić, and D. Nowak. On the freeze quantifier in constraint LTL: decidability and complexity. Technical Report LSV-05-03, LSV, 2005.
20. A. Emerson and J. Halpern. 'sometimes' and 'not never' revisited: on branching versus linear time temporal logic. /ACM, 33:151-178, 1986.
21. A. Finkel and J. Leroux. How to compose Presburger accelerations: Applications to broadcast protocols. In FST&TCS'02, volume 2256 of LNCS, pages 145-156, 2002.
22. M. Franceschet, M. de Rijke, and B.-H. Schlingloff. Hybrid logics on linear structures: Expressivity and complexity. In TIME-ICTL 2003, pages 164-171, 2003.
23. T. French. Quantified propositional temporal logic with repeating states. In TIME-ICTL 2003, pages 155-165, 2003.
24. D. Gabbay, A. Kurucz, F. Wolter, and M. Zakharyaschev. Many-dimensional modal logics: theory and practice. Cambridge University Press, 2003.
25. D. Gabelaia, R. Kontchakov, A. Kurucz, F. Wolter, and M. Zakharyaschev. On the computational complexity of spatio-temporal logics. In FLAIRS'03, pages 460-464, 2003.
26. V. Goranko. Hierarchies of modal and temporal logics with references pointers. Journal of Logic, Language, and Information, 5:1-24, 1996.
27. E. Harel, O. Lichtenstein, and A. Pnueli. Explicit clock temporal logic. In LICS'90, pages 400-413, 1990.
28. T. Henzinger. Half-order modal logic: how to prove realtime properties. In 9th Annual ACM Symposium on Principles of Distributed Computing, pages 281-296, 1990.
29. I. Hodkinson, R. Kontchakov, A. Kurucz, F. Wolter, and M. Zakharyaschev. On the computational complexity of decidable fragments of first-order linear temporal logics. In TIME-ICTL 2003, pages 91-98, 2003.
30. I. Hodkinson, RWolter, and M. Zakharyaschev. Decidable fragments of first-order temporal logics. APAL, 106:85-134, 2000.
31. O. Ibarra. Reversal-bounded multicounter machines and their decision problems. JACM, 25(1):116-133, 1978.
32. F. Laroussinie, N. Markey, and P. Schnoebelen. Temporal logic with forgettable past. In LICS'02, pages 383-392, 2002.
33. P. Revesz. Introduction to Constraint Databases. Springer, New York, 2002.
34. H. Rogers, Jr. Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, 1967.
35. A. Sistla and E. Clarke. The complexity of propositional linear temporal logic. JACM, 32(3):733-749, 1985.
36. F. Wolter and M. Zakharyaschev. Spatio-temporal representation and reasoning based on RCC-8. In KR'00, pages 3-14, 2000.
37. RWolter and M. Zakharyaschev. Axiomatizing the monodic fragment of first-order temporal logic. APAL, 118(133-145), 2002.