An automata-theoretic approach to constraint LTL

Information and Computation

Volumn 205, Issue 3, 2007, Pages 380-415

  Demri, Stéphane ^a   D'Souza, Deepak ^b  

^a CNRS   (France)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

Logics of space and time; Model checking; Temporal logic

Indexed keywords

AUTOMATA THEORY; COMPUTER CIRCUITS; FORMAL LOGIC; MODEL CHECKING;

AUTOMATA-THEORETIC APPROACH; CONCRETE DOMAINS; CONSTRAINT SYSTEMS; DECISION PROCEDURE; LINEAR TIME TEMPORAL LOGIC; LOGICS OF SPACE AND TIME; MONADIC SECOND-ORDER LOGIC; TEMPORAL LANGUAGE;

TEMPORAL LOGIC;

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

References (59)

1. J. F. Allen, Maintaining knowledge about temporal intervals, Communications of the ACM 26(11) (1983) 832-846.
2. R. Alur, D. Dill, A theory of timed automata, Theoretical Computer Science 126(1994) 183-235.
3. R. Alur, T. Henzinger, Real-time logics: complexity and expressiveness, Information and Computation 104(1) (1993) 35-77.
4. R. Alur, T. Henzinger, A really temporal logic, Journal of the Association for Computing Machinery 41(1) (1994) 181-204.
5. F. Baader, P. Hanschke, A scheme for integrating concrete domains into concept languages, in: 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, 1991, pp. 452-457.
6. P. Balbiani, J. Condotta, Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning, in: Frontiers of Combining Systems (FroCoS'02), Lecture Notes in Computer Science, vol. 2309, Springer, Berlin, 2002, pp. 162-176.
7. B. Bennett, Spatial reasoning with propositional logic, in: 4th Conference on Knowledge Representation and Reasoning, Morgan Kaufman, Los Altos, CA, 1994, pp. 51-62.
8. B. Bennett, F. Wolter, M. Zakharyaschev, Multi-dimensional modal logic as a framework for spatio-temporal reasoning, Applied Intelligence 17(3) (2002) 239-251. (Pubitemid 35227963)
9. B. Bérard, Untiming timed languages, Information Processing Letters 55(1995) 129-135.
10. M. Bojańczyk, A. Muscholl, T. Schwentick, L. Segoufin, C. David, Two-variable logic on words with data, in: LICS IEEE, 2006, pp. 7-16. (Pubitemid 47130347)
11. E. Börger, E. Grädel, Y. Gurevich, The Classical Decision Problem, Perspectives in Mathematical Logic, Springer, Berlin, 1997.
12. A. Bouajjani, R. Echahed, P. Habermehl, On the verification problem of nonregular properties for nonregular processes, in: LICS'95, 1995, pp. 123-133.
13. L. Bozzelli, R. Gascon, Branching-time temporal logic extended with Presburger constraints, in: LPAR'06, Lecture Notes in Computer Science, Springer, Berlin, 2006, to appear.
14. V. Bruyère, E. Dall'Olio, J. Raskin, Durations, parametric model-checking in timed automata with presburger arithmetic, in: STACS'03, Lecture Notes in Computer Science, vol. 2607, Springer, Berlin, 2003, pp. 687-698.
15. J. Büchi, On a decision method in restricted second order arithmetic. in: E. et al. (Eds.), ICM'60, Stanford University Press, 1960, pp. 1-11.
16. K. Čerāns, Deciding properties of integral relational automata, in: ICALP, Lecture Notes in Computer Science, vol. 820, Springer, Berlin, 1994, pp. 35-46.
17. H. Comon, V. Cortier, Flatness is not a weakness, in: 14th International Workshop Computer Science Logic, Lecture Notes in Computer Science, vol. 1862, Springer, Berlin, 2000, pp. 262-276.
18. H. Comon, Y. Jurski, Multiple counters automata, safety analysis and Presburger analysis, in: Computer-Aided Verification'98, Lecture Notes in Computer Science, vol. 1427, Springer, Berlin, 1998, pp. 268-279. (Pubitemid 128092345)
19. Z. Dang, P. S. Pietro, R. Kemmerer, Presburger liveness verification of discrete timed automata, Theoretical Computer Science 299(2003) 413-438.
20. R. Dechter, From local to global consistency, Artificial Intelligence (1992) 87-107.
21. S. Demri, Linear-time temporal logics with Presburger constraints: an overview, Journal of Applied Non-Classical Logics, to appear.
22. S. Demri, LTL over integer periodicity constraints, Theoretical Computer Science 360 (1-3) (2006) 96-123. (Pubitemid 44148891)
23. S. Demri, D. D'Souza, An automata-theoretic approach to constraint LTL, in: FST & TCS'02, Kanpur, Lecture Notes in Computer Science, vol. 2256, Springer, Berlin, 2002, pp. 121-132. (Pubitemid 36021131)
24. S. Demri, D. D'Souza, An automata-theoretic approach to constraint LTL, Tech. Rep. LSV-03-11, LSV, 40 pp. (August 2003).
25. S. Demri, R. Gascon, Verification of qualitative Z-constraints, in: CONCUR'05, Lecture Notes in Computer Science, vol. 3653, Springer, Berlin, 2005, pp. 518-532.
26. S. Demri, R. Gascon, The effects of bounding syntactic resources on Presburger LTL. Tech. Rep. LSV-06-5, LSV, 36 pp. (February 2006).
27. S. Demri, R. Lazic, LTL with the freeze quantifier and register automata, in: LICS'06, IEEE, 2006, pp. 17-26. (Pubitemid 47130348)
28. S. Demri, R. Lazic, D. Nowak, On the freeze quantifier in constraint LTL: decidability and complexity, Information and Computation To appear in a special issue dedicated to selected papers from TIME'05.
29. A. Deutsch, L. Sui, V. Vianu, Specification and verification of data-driven web services. in: PODS'04, Paris, 2004, pp. 71-82.
30. A. Finkel, J. Leroux, How to compose Presburger accelerations: applications to broadcast protocols, in: M. Agrawal, A. Seth (Eds.), FST&TCS'02, Kanpur, Lecture Notes in Computer Science, vol. 2256, Springer, Berlin, 2002, pp. 145-156. (Pubitemid 36021133)
31. L. Fribourg, M. V. Peixoto, Concurrent Constraint Automata, Tech. Rep. LIENS-93-10, Ecole NormaleSupérieure (1993).
32. D. Gabbay, A. Kurucz, F. Wolter, M. Zakharyaschev, Many-dimensional modal logics: theory and applications, Cambridge University Press, 2003.
33. D. Gabelaia, R. Kontchakov, A. Kurucz, F. Wolter, M. Zakharyaschev, On the computational complexity of spatio-temporal logics, in: FLAIRS'03, St Augustine, Florida, 2003, pp. 460-464.
34. P. Gastin, D. Kuske, Satisfiability and model checking for MSO-definable temporal logics are in PSPACE, in: CON-CUR'03, Marseille, France, Lecture Notes in computer Science, vol. 2761, Springer, Berlin, 2003, pp. 222-236.
35. 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 International Symposium on Temporal Representation and Reasoning and 4th International Conference on Temporal Logic (TIME-ICTL), IEE, 2003, pp. 91-98.
36. O. Ibarra, J. Su, Z. Dang, T. Bultan, A. Kemmerer, Counter machines: decidable properties and applications to verification problems, in: MFCS'00, Lecture Notes in Computer Science, vol. 1893, Springer, Berlin, 2000, pp. 426-435.
37. R. Lazic, Safely freezing LTL. in: FSTTCS'06, Lecture Notes in Computer Science, Springer, Berlin, 2006, to appear.
38. A. Lisitsa, I. Potapov, Temporal logic with predicate λ-abstraction, in: TIME, 2005, pp. 147-155.
39. C. Lutz, Interval-based temporal reasoning with general TBoxes, in: 17th International Joint Conference on Artificial Intelligence (IJCAI'01), Morgan-Kaufmann, Los Altos, CA, 2001, pp. 89-94.
40. C. Lutz, Reasoning with the description logic ALCF (D), Logic Journal of the IGPL 10(5) (2002) 535-568.
41. C. Lutz, Description logics with concrete domains-a survey, in: Advances in Modal Logics, vol. 4, King's College Publications, 2003, pp. 265-296.
42. C. Lutz, NEXPTIME-complete description logics with concrete domains, ACM Transactions on Computational Logic 5(4) (2004) 669-705.
43. C. Lutz, M. Milicic, A tableau algorithm for description logics with concrete domains and GCIs, in: TABLEAUX'05, Lecture Notes in Computer Science, vol. 3702, Springer, Berlin, 2005, pp. 201-216.
44. N. Markey, F. Laroussinie, P. Schnoebelen, Temporal logic with forgettable past, in: 17th IEEE Symposium Logic in Computer Science (LICS'2002), Copenhagen, Denmark, IEE Comp. Soc. Press, 2002, pp. 383-392.
45. M. Müller-Olm, H. Seidl, Computing Interprocedurally Valid Relations in Affine Programs, Technical Rep. University of Trier (2003).
46. A. Pnueli, The temporal logic of programs. in: Proc. 18th IEEE Symposium on Foundation of Computer Science, 1977, pp. 46-57.
47. D. Randell, Z. Cui, A. Cohn, A spatial logic based on regions and connection, in: 3rd Conference on Knowledge Representation and Reasoning, Morgan Kaufman, Los Altos, CA, 1992, pp. 165-176.
48. P. Revesz, Introduction to Constraint Databases, Springer, New York, 2002.
49. M. Roger, J. Goubault-Larrecq, Log auditing through model-checking, in: 14th Computer Security Foundations Workshop (CSFW'01), Cape Breton, Nova Scotia, Canada, IEE Computer Society Press, 2001, pp. 220-236.
50. S. Safra, On the complexity of ω-automata, in: Proc. 29th IEEE Symp. on Foundations of Computer Science, 1988, pp. 319-327.
51. P. Sistla, E. M. Clarke, The complexity of propositional linear temporal logics, Journal of the Association for Computing Machinery 32(3) (1985) 733-749. (Pubitemid 15507395)
52. W. Thomas, Automata on infinite objects, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, volume B, Formal Models and Semantics, Elsevier, 1990, pp. 133-191.
53. M. Vardi, An automata-theoretic approach to linear temporal logic, in: F. Moller, G. Birtwistle (Eds.), Logics of Concurrency: Structure versus Automata, Lecture Notes in Computer Science, vol. 1043, Springer, Berlin, 1996, pp. 238-266. (Pubitemid 126047609)
54. M. Vardi, P. Wolper, An automata theoretic approach to automatic program verification, in: Logic in Computer Science, IEEE, 1986, pp. 332-334.
55. M. Vardi, P. Wolper, Reasoning about infinite computations, Information and Computation 115(1994) 1-37.
56. M. Vilain, H. Kautz, Constraint propagation algorithms for temporal reasoning, in: T. Kehler, S. Rosenschein (Eds.), 5th National Conference on Artificial Intelligence (AAAI'86), Morgan Kaufman, Los Altos, CA, 1986, pp. 372-382.
57. P. Wolper, Temporal logic can be more expressive, Information and Computation 56(1983) 72-99. (Pubitemid 14570587)
58. F. Wolter, M. Zakharyaschev, Spatio-temporal representation and reasoning based on RCC-8, in: KR'00, Morgan Kaufmann, Los Altos, CA, 2000, pp. 3-14.
59. F. Wolter, M. Zakharyaschev, Qualitative spatio-temporal representation and reasoning: a computational perspective, in: G. Lakemeyer, B. Nebel (Eds.), Exploring Artificial Intelligence in the New Millenium, Morgan Kaufman, Los Altos, CA, 2002, pp. 175-216.