On the freeze quantifier in Constraint LTL: Decidability and complexity

Information and Computation

Volumn 205, Issue 1, 2007, Pages 2-24

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

^a CNRS   (France)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

Author keywords

Computational complexity; Constraints; Decidability; Freeze quantifier; Linear time temporal logic

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; FORMAL LANGUAGES; FORMAL LOGIC;

COMPLEXITY RESULTS; CONSTRAINTS; FIRST-ORDER TEMPORAL LOGIC; FREEZE QUANTIFIERS; LAMBDA ABSTRACTION; LINEAR TIME TEMPORAL LOGIC; OPERATIONAL MODEL; SEQUENCE DIAGRAMS;

TEMPORAL LOGIC;

EID: 84855204406     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.08.003     Document Type: Article

References (53)

1. S. Demri, R. Lazić, D. Nowak, On the freeze quantifier in constraint LTL: decidability and complexity, in: 12th Int. Symp. Temporal Representation and Reasoning (TIME), IEEE, 2005, pp. 113-121.
2. P. Schnoebelen, The complexity of temporal logic model checking, in: AiML'02, vol. 4 of Advances in Modal Logic, King's College, 2003, pp. 393-436.
3. P. Revesz, Introduction to Constraint Databases, Springer, Berlin, 2002.
4. R. Alur, D. Dill, A theory of timed automata, Theor. Comput. Sci. 126(1994) 183-235.
5. O. Ibarra, Reversal-bounded multicounter machines and their decision problems, J. ACM 25(1) (1978) 116-133.
6. B. Boigelot, Symbolic methods for exploring infinite state spaces, Ph. D. thesis, Université de Liège, (1998).
7. B. Boigelot, P. Wolper, Representing arithmetic constraints with finite automata: an overview, in: 18th Int. Conf. Logic Prog. (ICLP), vol. 2401 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pp. 1-19.
8. A. Finkel, J. Leroux, How to compose Presburger accelerations: Applications to broadcast protocols, in: 22nd Conf. Foundations of Software Tech. and Theoretical Comput. Sci. (FSTTCS), vol. 2256 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pp. 145-156. (Pubitemid 36021133)
9. J. Leroux, G. Sutre, Flat counter systems are everywhere!, in: 3rd Int. Symp. Automated Tech. for Verification and Analysis (ATVA), vol. 3707 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pp. 489-503.
10. H. Comon, V. Cortier, Flatness is not a weakness, in: 14th Int. Works. Comput. Sci. Logic (CSL), vol. 1862 of Lecture Notes in Computer Science, Springer, Berlin, 2000, pp. 262-276.
11. S. Demri, D. D'Souza, An automata-theoretic approach to constraint LTL, Tech. Rep. 03-11, LSV, an extended abstract appeared in FSTTCS'02(2003).
12. R. Alur, T. Henzinger, A really temporal logic, J. ACM 41(1) (1994) 181-204.
13. E. Harel, O. Lichtenstein, A. Pnueli, Explicit clock temporal logic, in: 5th Symp. Logic in Comput. Sci. (LICS), IEEE, 1990, pp. 400-413.
14. S. Demri, LTL over Integer Periodicity Constraints, Tech. Rep. 04-6, LSV, an extended abstract appeared in FOSS-ACS'04(2004).
15. A. Lisitsa, I. Potapov, Temporal logic with predicate λ-abstraction, in: 12th Int. Symp. Temporal Representation and Reasoning (TIME), IEEE, 2005, pp. 147-155.
16. F. Wolter, M. Zakharyaschev, Spatio-temporal representation and reasoning based on RCC-8, in: 7th Int. Conf. Principles of Knowledge Representation and Reasoning (KR), Morgan Kaufmann, Los Altos, CA, 2000, pp. 3-14.
17. P. Balbiani, J. Condotta, Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning, in: 4th Int. Works. Frontiers of Combining Systems (FroCoS), vol. 2309 of Lecture Notes in Artificial Intelligence, Springer, Berlin, 2002, pp. 162-173.
18. D. Gabelaia, R. Kontchakov, A. Kurucz, F. Wolter, M. Zakharyaschev, On the computational complexity of spatio-temporal logics, in: 16th Int. Florida AI Research Soc. Conf. (FLAIRS), AAAI, 2003, pp. 460-464.
19. A. Sistla, E. Clarke, The complexity of propositional linear temporal logic, J. ACM 32(3) (1985) 733-749. (Pubitemid 15507395)
20. *: separating the expressive and distinguishing powers, Logic J. IGPL 7(1) (1999) 55-78.
21. O. Ibarra, Z. Dang, On removing the stack from reachability constructions, in: Int. Symp. Algorithms and Computation (ISAAC), vol. 2223 of Lecture Notes in Computer Science, Springer, Berlin 2001, pp. 244-256.
22. A. Bouajjani, P. Habermehl, Constrained properties, semilinear sets, Petri nets, in: 7th Int. Conf. Concurrency Theory (CONCUR), vol. 1119 of Lecture Notes in Computer Science, Springer, Berlin, 1996, pp. 481-497. (Pubitemid 126117778)
23. B. ten Cate, M. Franceschet, On the complexity of hybrid logics with binders, in: 19th Int. Works. Comput. Sci. Logic (CSL), Vol. 3634 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pp. 339-354. (Pubitemid 41472664)
24. P. Wolper, Temporal logic can be more expressive, Inf. Comput. 56(1983) 72-99. (Pubitemid 14570587)
25. P. van Emde Boas, The convenience of tilings, in: Complexity, Logic, Recursion Theory, vol. 187 of Lecture Notes in Pure Applied Logic, Marcel Dekker, 1997, pp. 331-363.
26. F. Laroussinie, N. Markey, P. Schnoebelen, Temporal logic with forgettable past, in: 17th Symp. Logic in Comput. Sci. (LICS), IEEE, 2002, pp. 383-392.
27. E. Kieronski, EXPSPACE-complete variant of guarded fragment with transitivity, in: 19th Ann. Symp. Theoretical Aspects of Comput. Sci. (STACS), Vol. 2285 of Lecture Notes in Computer Science, Springer, Berlin, 2002, pp. 608-619.
28. A. Emerson, J. Halpern, "Sometimes" and "Not Never" revisited: on branching versus linear time temporal logic, J. ACM 33(1986) 151-178. (Pubitemid 16461377)
29. S. Demri, R. Gascon. Verification of qualitative ℤ-constraints, in: 16th Int. Conf. Concurrency Theory (CONCUR), Vol. 3653 of Lecture Notes in Computer Science, Springer, Berlin, 2005, pp. 518-532.
30. H. Rogers Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967.
31. F. Neven, T. Schwentick, V. Vianu, Finite state machines for strings over infinite alphabets, ACM Trans. Comput. Logic 5(3) (2004) 403-435.
32. C. David. Mots et données infinies, Master's thesis, LIAFA (2004).
33. C. Lutz, NEXPTIME-complete description logics with concrete domains, ACM Trans. Comput. Logic 5(4) (2004) 669-705.
34. A. Bouajjani, R. Echahed, and P. Habermehl, On the verification problem of nonregular properties for nonregular processes, in: 10th Symp. Logic in Comput. Sci. (LICS), IEEE, 1995, pp. 123-133.
35. T. Henzinger. Half-order modal logic: how to prove real-time properties, in: 9th Ann. Symp. Principles of Distr. Comput. (PODC), ACM, 1990, pp. 281-296.
36. T. Brihaye, V. Bruyère, J. Raskin, Model-checking for weighted timed automata, in: 2nd Int. Conf. Formal Modelling and Analysis of Timed Systems (FORMATS), Vol. 3253 of Lecture Notes in Computer Science, Springer, Berlin, 2004, pp. 277-292. (Pubitemid 39738310)
37. R. Alur, T. Henzinger, A really temporal logic, in: 30th Ann. Symp. Foundations Comput. Sci. (FOCS), IEEE, 1989, pp. 164-169.
38. R. Alur, T. Feder, T. Henzinger, The benefits of relaxing punctuality, J. ACM 43(1996) 116-146. (Pubitemid 126607636)
39. V. Goranko, Hierarchies of modal and temporal logics with references pointers, J. Logic, Lang. and Inf. 5(1996) 1-24.
40. C. Areces, P. Blackburn, M. Marx, A road-map on complexity for hybrid logics, in: 13th Int. Works. Comput. Sci. Logic (CSL), Vol. 1683 of Lecture Notes in Computer Science, Springer, Berlin, 1999, pp. 307-321.
41. M. Franceschet, M. de Rijke, B.-H Schlingloff, Hybrid logics on linear structures: Expressivity and complexity, in: 10th Int. Symp. Temporal Representation and Reasoning and 4th Int. Conf. Temporal Logic (TIME-ICTL), IEEE, 2003, pp. 164-171.
42. F. de Boer, R. van Eijk, Decidable navigation logics for object structures, in: 15th Int. Works. Comput. Sci. Logic (CSL), Vol. 2142 of Lecture Notes in Computer Science, Springer, Berlin, 2001, pp. 324-338.
43. S. M. Cho, H. H. Kim, S. D. Cha, D. H. Bae, A semantics of sequence diagrams, Inf. Process. Lett. 84(2002) 125-130. (Pubitemid 35018944)
44. T. French, Quantified propositional temporal logic with repeating states, in: 10th Int. Symp. Temporal Representation and Reasoning and 4th Int. Conf. Temporal Logic (TIME-ICTL), IEEE, 2003, pp. 155-165.
45. M. Fitting, Modal logic between propositional and first-order, J. Logic and Comput. 12(6) (2002) 1017-1026.
46. A. Degtyarev, M. Fisher, A. Lisitsa, Equality and monodic first-order temporal logic, Studia Logica 72(2002) 147-156.
47. F. Wolter, M. Zakharyaschev, Axiomatizing the monodic fragment of first-order temporal logic, Ann. Pure Appl. Logic 118(2002) 133-145.
48. I. Hodkinson, R. Kontchakov, A. Kurucz, F. Wolter, M. Zakharyaschev, On the computational complexity of decidable fragments of first-order linear temporal logics, in: 10th Int. Symp. Temporal Representation and Reasoning and 4th Int. Conf. Temporal Logic (TIME-ICTL), IEEE, 2003, pp. 91-98.
49. D. Gabbay, A. Kurucz, F. Wolter, M. Zakharyaschev, Many-dimensional modal logics: theory and practice, Cambridge University Press, 2003.
50. I. Hodkinson, F. Wolter, M. Zakharyaschev, Decidable fragments of first-order temporal logics, Ann. Pure and Applied Logic 106(2000) 85-134.
51. P. Bouyer, A. Petit, D. Thérien, An algebraic approach to data languages and timed languages, Inf. and Comput. 182(2) (2003) 137-162.
52. P. Bouyer, A logical characterization of data languages, Inf. Process. Lett. 84(2) (2002) 75-85. (Pubitemid 34974857)
53. M. Bojańczyk, C. David, A. Muscholl, T. Schwentick, L. Segoufin, Two-variable logic on words with data, Tech. Rep. 2005-004, LIAFA (2005).