LTL over integer periodicity constraints

Theoretical Computer Science

Volumn 360, Issue 1-3, 2006, Pages 96-123

  Demri, Stéphane ^a  

^a CNRS   (France)

Author keywords

B chi automaton; Computational complexity; Periodicity constraints; Presburger LTL; QBF

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; PROBLEM SOLVING; SEMANTICS;

BÜCHI AUTOMATON; PERIODICITY CONSTRAINTS; PRESBURGER LTL; QBF;

LOGIC PROGRAMMING;

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

References (73)

1. Abadi M. The power of temporal proofs. Theoret. Comput. Sci. 65 (1989) 35-83
2. Alur R., and Dill D. A theory of timed automata. Theoret. Comput. Sci. 126 (1994) 183-235
3. Alur R., and Henzinger Th. Real-time logics: complexity and expressiveness. Inform. and Comput. 104 1 (1993) 35-77
4. Alur R., and Henzinger Th. A really temporal logic. J. Assoc. Comput. Mach. 41 1 (1994) 181-204
5. Balbiani Ph., and Condotta J.F. Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. In: Armando A. (Ed). Frontiers of Combining Systems (FroCoS'02), Lecture Notes in Artificial Intelligence Vol. 2309 (2002), Springer, Berlin 162-173
6. Bartzis C., and Bultan T. Efficient symbolic representation for arithmetic constraints in verification. Internat. J. Found. Comput. Sci. 14 4 (2003) 605-624
7. E. Bertino, C. Bettini, E. Ferrari, P. Samarati, Supporting periodic authorizations and temporal reasoning in database access control, in: 22nd VLDB, Bombay, India, 1996, pp. 472-483.
8. Bertino E., Bettini C., Ferrari E., and Samarati P. An access control model supporting periodicity constraints and temporal reasoning. ACM Trans. Databases Systems 23 3 (1998) 231-285
9. Blackburn P. Representation, reasoning, and relational structures: a hybrid logic manifesto. Logic J. IGPL 8 3 (2000) 339-365
10. A. Bouajjani, R. Echahed, P. Habermehl, On the verification problem of nonregular properties for nonregular processes, in: LICS'95, 1995, pp. 123-133.
11. Bouajjani A., and Habermehl P. Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations. Theoret. Comput. Sci. 221 1-2 (1999) 211-250
12. Bouyer P., Dufourd C., Fleury E., and Petit A. Are timed automata updatable?. in: CAV'00, Lecture Notes in Computer Science Vol. 1855 (2000), Springer, Berlin 464-479
13. Bresolin D., Montanari A., and Puppis G. Time granularities and ultimately periodic automata. JELIA'04, Lecture Notes in Computer Science Vol. 3229 (2004), Springer, Berlin 513-525
14. Čerāns K. Deciding properties of integral relational automata. ICALP-21, Lecture Notes in Computer Science Vol. 820 (1994), Springer, Berlin 35-46
15. Cerrito S., Cialdea Mayer M., and Praud S. First-order linear temporal logic over finite time structures. In: Ganzinger H., McAllester D., and Voronkov A. (Eds). Sixth Internat. Conf. Logic Programming and Automated Reasoning, Tbilisi, Republic of Georgia (LPAR'99), Lecture Notes in Computer Science Vol. 1705 (1999), Springer, Berlin 62-76
16. A. Chandra, P. Merlin, Optimal implementation of conjunctive queries in relational databases, in: Ninth ACM Symp. Theory of Computing, 1977, pp. 77-90.
17. Choffrut C., and Goldwurm M. Timed automata with periodicity clock constraints. J. Automata Languages Combin. 5 4 (2000) 371-404
18. Clarke E., Grumberg O., and Peled D. Model Checking (2000), The MIT Press Books, Cambridge, MA
19. Combi C., Franceschet M., and Peron A. A logical approach to represent and reason about calendars. Internat. Symp. Temporal Representation and Reasoning (2002), IEEE Computer Society Press, Silver Spring, MD 134-140
20. Combi C., Franceschet M., and Peron A. Representing and reasoning about temporal granularities. J. Logic Comput. 14 1 (2004) 51-77
21. Comon H., and Cortier V. Flatness is not a weakness. in: 14th International Workshop Computer Science Logic, Lecture Notes in Computer Science Vol. 1862 (2000), Springer, Berlin 262-276
22. Comon H., and Jurski Y. Multiple counters automata, safety analysis and Presbúrger arithmetic. In: Hu A., and Vardi M. (Eds). Proc. Computer Aided Verification, Vancouver, Lecture Notes in Computer Science Vol. 1427 (1998), Springer, Berlin 268-279
23. Dang Z., San Pietro P., and Kemmerer R. Presbúrger liveness verification of discrete timed automata. Theoret. Comput. Sci. 299 (2003) 413-438
24. S. Demri, LTL over integer periodicity constraints, Technical Report LSV-04-6, LSV, February 2004, p. 35 (Extended version of S. Demri, LTL over integer periodicity constraints (extended abstract), in: I. Walukiewicz (Ed.), FOSSACS'04, Lecture Notes in Computer Science, Vol. 2987, Springer, Berlin, 2004, pp. 121-135).
25. Demri S. LTL over integer periodicity constraints (extended abstract). In: Walukiewicz I. (Ed). FOSSACS'04, Lecture Notes in Computer Science Vol. 2987 (2004), Springer, Berlin 121-135
26. Demri S., and D'Souza D. An automata-theoretic approach to constraint LTL. In: Agrawal M., and Seth A. (Eds). FST&TCS'02, Kanpur, Lecture Notes in Computer Science Vol. 2556 (2002), Springer, Berlin 121-132
27. S. Demri, D. D'Souza, An automata-theoretic approach to constraint LTL, Technical Report LSV-03-11, LSV, August 2003, p. 40 (Extended version of S. Demri, D. D'Souza, An automata-theoretic approach to constraint LTL, in: M. Agrawal, A. Seth (Eds.), FST&TCS'02, Kanpur, Lecture Notes in Computer Science, Vol. 2556, Springer, Berlin, 2002, pp. 121-132).
28. S. Demri, R. Gascon, Verification of qualitative Z-constraints, in: M. Abadi, de L. Alfaro (Eds.), Proc. 16th Internat. Conf. Concurrency Theory (CONCUR'05), Lecture Notes in Computer Science, Vol. 3653, San Francisco, CA, USA, August 2005, Springer, Berlin, pp. 518-532.
29. Demri S., Lazić R., and Nowak D. On the freeze quantifier in constraint LTL: decidability and complexity. 12th Internat. Symp. Temporal Representation and Reasoning, Burlington, Vermont (2005), IEEE Computer Society Press, Silver Spring, MD 113-121
30. Downey R., and Fellows M. Parameterized Complexity, Monographs in Computer Science (1999), Springer, Berlin
31. Downey R., Fellows M., and Stege U. Computational tractability: the view from Mars. Bull. EATCS 69 (1999) 73-97
32. Estrin A., and Kaminski M. The expressive power of temporal logic of actions. J. Logic Comput. 12 (2002) 839-859
33. Ferrante J., and Rackoff Ch. A decision procedure for the first order theory of real addition with order. SIAM J. Comput. 4 1 (1975) 69-76
34. 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.
35. Finkel A., and Sutre G. Decidability of reachability problems for classes of two counters automata. in: 17th Annu. Symp. Theoretical Aspects of Computer Science, Lecture Notes in Computer Science Vol. 2256 (2000), Springer, Berlin 346-357
36. Fitting M. Modal logic between propositional and first-order. J. Logic Comput. 12 6 (2002) 1017-1026
37. Gabbay D., Hodkinson I., and Roynolds M. Temporal Logic-Mathematical Foundations and Computational Aspects Vol. 1 (1994), Oxford University Press, Oxford
38. Gabbay D., Kurucz A., Wolter F., and Zakharyaschev M. Many-dimensional Modal Logics: Theory and Practice (2003), Cambridge University Press, Cambridge
39. 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.
40. Gastin P., and Kuske D. Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. CONCUR'03, Lecture Notes in Computer Science Vol. 2761 (2003), Springer, Berlin 222-236
41. Ginsburg S., and Spanier E. Semigroups, Presburger formulas and languages. Pacific J. Math. 16 2 (1966) 285-296
42. Goranko V. Hierarchies of modal and temporal logics with references pointers. J. Logic Language Inform. 5 (1996) 1-24
43. Henzinger Th., Majumdar R., and Raskin J.F. A classification of symbolic transitions systems. ACM Trans. Comput. Logic 6 1 (2005) 1-32
44. Hopcroft J., and Ullman J. Introduction to Automata Theory, Languages and Computation (1979), Addison-Wesley, Reading, MA
45. Jančar P., Kučera A., Möller F., and Sawa Z. Equivalence-checking with one-counter automata: a generic method for proving lower bounds. FOSSACS'02, Lecture Notes in Computer Science Vol. 2256 (2002), Springer, Berlin 172-186
46. Koubarakis M. Complexity results for first-order theories of temporal constraints. In: Doyle J., Sandewall E., and Torasso P. (Eds). Fourth Internat. Conf. Principles of Knowledge Representation and Reasoning (KR'94) (1994) 379-390
47. Kreisel G., and Krivine J.L. Elements of Mathematical Logic, Studies in Logic and the Foundations of Mathematics (1967), North-Holland Publishing Company, Amsterdam
48. Kröger F. On the interpretability of arithmetic in temporal logic. Theoret. Comput. Sci. 73 (1990) 47-61
49. Dal Lago U., and Montanari A. Calendars, time granularities, and automata. in: Internat. Symp. Spatial and Temporal Databases, Lecture Notes in Computer Science Vol. 2121 (2001), Springer, Berlin 279-298
50. Dal Lago U., Montanari A., and Puppis G. Towards compact and tractable automaton-based representations of time granularities. in: ICTCS 2003, Lecture Notes in Computer Science Vol. 2841 (2003), Springer, Berlin 72-85
51. Lamport L. The temporal logic of actions. ACM Trans. Programming Languages 16 (1994) 872-923
52. Laroussinie F., Markey N., and Schnoebelen Ph. Temporal logic with forgettable past. LICS'02 (2002), IEEE Computer Society, Silver Spring, MD 383-392
53. Lisitsa A., and Potapov I. Temporal logic with predicate λ-abstraction. 12th Internat. Symp. Temporal Representation and Reasoning, Burlington, Vermont (2005), IEEE Computer Society Press, Silver Spring, MD 147-155
54. Lutz C. Interval-based temporal reasoning with general TBoxes. 17th Internat. Joint Conf. Artificial Intelligence (IJCAI'01) (2001), Morgan Kaufmann, Los Altos, CA 89-94
55. Lutz C. NEXPTIME-complete description logics with concrete domains. ACM Trans. Comput. Logic 5 4 (2004) 669-705
56. Lutz C., and Miličić M. A tableau algorithm for description logics with concrete domains and GCIs. TABLEAUX'05, Lecture Notes in Computer Science Vol. 3702 (2005), Springer, Berlin 201-216
57. Merz S. A more complete TLA. In: Wing J.M., Woodlock J., and Davies J. (Eds). FM'99, Lecture Notes in Computer Science Vol. 1709 (1999), Springer, Berlin 1226-1244
58. Müller-Olm M., and Seidl H. Program analysis through linear algebra. ACM Symp. Principles of Programming Languages (POPL'04) (2004) 330-341
59. Niezette M., and Stevenne J. An efficient symbolic representation of periodic time. in: Proc. Internat. Conf. Information and Knowledge Management, Baltimore, Maryland, Lecture Notes in Computer Science Vol. 752 (1992), Springer, Berlin 161-168
60. Ohlbach H.J. Calendar logic. In: Gabbay D., Hodkinson I., and Reynolds M. (Eds). Temporal Logic-Mathematical Foundations and Computational Aspects Vol. 1 (1994), Oxford University Press, Oxford (Chapter 19)
61. Papadimitriou Ch. Computational Complexity (1994), Addison-Wesley Publishing Company, Reading, MA
62. M. Presburger, Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt, Comptes Rendus du premier congrès de mathématiciens des Pays Slaves, Warszawa, 1929, 92-101.
63. Revesz P. Introduction to Constraint Databases (2002), Springer, New York
64. Sistla A., and Clarke E. The complexity of propositional linear temporal logic. J. Assoc. Comput. Mach. 32 3 (1985) 733-749
65. Tarski A. A Decision Method for Elementary Algebra and Geometry (1951), University of California Press, Berkeley, CA
66. Toman D., and Chomicki J. DATALOG with integer periodicity constraints. J. Logic Programming 35 3 (1998) 263-290
67. Trahtenbrot B. Impossibility of an algorithm for the decision problem in finite classes. Amer. Math. Soc. Trans. Ser. 23 2 (1963) 1-5
68. van Emde Boas P. The convenience of tilings. In: Sorbi A. (Ed). Complexity, Logic, and Recursion Theory, Lecture Notes in Pure and Applied Logic Vol. 187 (1997), Marcel Dekker, Inc., New York 331-363
69. Vardi M., and Wolper P. Reasoning about infinite computations. Inform. and Comput. 115 (1994) 1-37
70. Wijsen J. A string based-model for infinite granularities. AAAI Workshop on Spatial and Temporal Granularity (2000), AAAI Press, Menlo Park, CA 9-16
71. Wolper P. Temporal logic can be more expressive. Inform. and Comput. 56 (1983) 72-99
72. Wolper P. Representing periodic temporal information with automata. Eighth Internat. Symp. Temporal Representation and Reasoning (TIME'01) (2001), IEEE Computer Society, Silver Spring, MD 179
73. Wolper P., and Boigelot B. On the construction of automata from linear arithmetic constraints. in: Sixth Internat. Conf. Tools and Algorithms for the Construction and Analysis of Systems, Lecture Notes in Computer Science Vol. 1785 (2000), Springer, Berlin 1-19