LTL over integer periodicity constraints (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2987, Issue , 2004, Pages 121-135

  Demri, Stéphane ^a  

^a UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ACCESS CONTROL; COMPUTATION THEORY; COMPUTATIONAL LINGUISTICS; COMPUTER CIRCUITS; DIGITAL ARITHMETIC; EQUIVALENCE CLASSES; FORMAL LOGIC; RECONFIGURABLE HARDWARE;

CONSTRAINT LANGUAGE; EQUIVALENCE PROBLEM; EXTENDED ABSTRACTS; LINEAR TIME TEMPORAL LOGIC; LOGICAL FORMALISM; PRESBURGER ARITHMETIC; SATISFIABILITY PROBLEMS; TIME GRANULARITIES;

TEMPORAL LOGIC;

EID: 22944462915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24727-2_10     Document Type: Article

References (29)

1. [Aba89] M. Abadi. The power of temporal proofs. TCS, 65:35-83, 1989.
2. [AD94] R. Alur and D. Dill. A theory of timed automata. TCS, 126:183-235, 1994.
3. [AH94] R. Alur and Th. Henzinger. A really temporal logic. JACM, 41(1):181-204, 1994.
4. [BBFS96] E. Bertino, G. Bettini, E. Ferrari, and P. Samarati. Supporting periodic authorizations and temporal reasoning in database access control. In 22nd VLDB, Bombay, India, pages 472-483, 1996.
5. [BBFS98] E. Bertino, C. Bettini, E. Ferrari, and P. Samarati. An access control model supporting periodicity constraints and temporal reasoning. ACM Transactions on Databases Systems, 23(3):231-285, 1998.
6. [BC02] Ph. Balbiani and J.F. Condotta. Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning. In FroCoS'02, vol. 2309 of LNAI, pages 162-173. Springer, 2002.
7. [BEH95] A. Bouajjani, R. Echahed, and P. Habermehl. On the verification problem of nonregular properties for nonregular processes. In LICS'95, pages 123-133, 1995.
8. [BII99] A. Bouajjani and P. Habermehl. Symbolic reachability analysis of FIFOchannel systems with nonregular sets of configurations. TCS, 221(1-2) :211250, 1999.
9. CC00] H. Comon and V. Cortier. Flatness is not a weakness. In CSL-14, vol. 1862 of LNCS, pages 262-276. Springer-Verlag, 2000.
10. [Čer94] K. Čerans. Deciding properties of integral relational automata. In ICALP21, vol. 820 of LNCS, pages 35-46. Springer, 1994.
11. [CFP02] C. Combi, M. Franceschet, and A. Peron. A logical approach to represent and reason about calendars. In Int. Symposium on Temporal Representation and Reasoning, pages 134-140. IEEE Computer Society Press, 2002.
12. [CM77] A. Chandra and P. Merlin. Optimal implementation of conjunctive queries in relational databases. In STOC-9, pages 77-90, 1977.
13. [DD02] S. Demri and D. D'Souza. An automata-theoretic approach to constraint LTL. In FST&TCS'02, vol. 2556 of LNCS, pages 121-132. Springer, 2002.
14. [DD03] S. Demri and D. D'Souza. An automata-theoretic approach to constraint LTL. Technical Report LSV-03-11, LSV, August 2003. 40 pages. Submitted.
15. [DemOS] S. Demri. LTL over Integer Periodicity Constraints. Technical Report LSV03-13, LSV, October 2003. 34 pages.
16. [FL02] A. Finkel and J. Leroux. How to compose Presburger accelerations: Applications to broadcast protocols. In FST&TCS'02, vol. 2256 of LNCS, pages 145-156. Springer, 2002.
17. [GHR94] D. Gabbay, I. Hodkinson, and M. Reynolds. Temporal Logic - Mathematical Foundations and Computational Aspects, Volume 1. OUP, 1994.
18. [GK03] P. Gastin and D. Kuske. Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. In CONCUR'03, vol. 2761 of LNCS, pages 222-236. Springer, 2003.
19. [KK67] G. Kreisel and J.L. Krivine. Elements of Alathematical Logic. Studies in Logic and the Foundations of Mathematics. North-Holland, 1967.
20. [LM01] U. Dal Lago and A. Montanari. Calendars, time granularities, and automata. In Int. Symposium on Spatial and Temporal Databases, vol. 2121 of LNCS, pages 279-298. Springer, 2001.
21. [LMS02] F. Laroussinie, N. Markey, and Ph. Schnoebelen. Temporal logic with forgettable past. In LICS'02, pages 383-392. IEEE Computer Society, 2002.
22. [NS92] M. Niezette and J. Stevenne. An efficient symbolic representation of periodic time. In Proc. of the International Conference on Information and Knowledge Management, vol. 752 of LNCS, pages 161-168. Springer, 1992.
23. [Oh194] H.J. Ohlbach. Calendar logic. In [GHR94], chapter 19. 1994.
24. [Pre29] 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, pages 92-101, 1929.
25. [SC85] A. Sistla and E. Clarke. The complexity of propositional linear temporal logic. JACM, 32(3):733-749, 1985.
26. [TC98] D. Toman and J. Chomicki. DATALOG with integer periodicity constraints. Journal of Logic Programming, 35(3):263-290, 1998.
27. [VW94] M. Vardi and P. Wolper. Reasoning about infinite computations. Information and Computation, 115:1-37, 1994.
28. [WB00] P. Wolper and B. Boigelot. On the construction of automata from linear arithmetic constraints. In TACAS-6, vol. 1785 of LNCS, pages 1-19. Springer, 2000.
29. [Wij00] J. Wijsen. A string based-model for infinite granularities. In AAAI Workshop on Spatial and Temporal Granularity, pages 9-16. AAAI Press, 2000.