A decidable temporal logic of repeating values

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

Volumn 4514 LNCS, Issue , 2007, Pages 180-194

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

^a INRIA   (France)

^b INDIAN INSTITUTE OF SCIENCE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER OPERATING PROCEDURES; COMPUTER SYSTEMS; LINEAR EQUATIONS; MATHEMATICAL MODELS;

FREEZE QUANTIFIERS; INFINITE SETS; LOGICAL FORMALISMS; REPEATING VALUES;

TEMPORAL LOGIC;

EID: 35449008029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72734-7_13     Document Type: Conference Paper

References (23)

1. C. Areces, P. Blackburn, and M. Marx. Hybrid logics: characterization, interpolation and complexity. JSL, 66(3):977-1010, 2001.
2. R. Alur and Th. Henzinger. A really temporal logic. JACM, 41(1):181-204, 1994.
3. M. Bojańczyk, A. Muscholl, Th. Schwentick, L. Segoufin, and C. David. Two-variable logic on words with data. In LICS'06, pages 7-16. IEEE, 2006.
4. S. Demri and D. D'Souza. An automata-theoretic approach to constraint LTL. I & C, 205(3):380-415, 2007.
5. S. Demri, D. D'Souza, and R. Gascon. A decidable temporal logic of repeating values. Technical report, LSV, 2007.
6. S. Demri and R. Lazić. LTL with the freeze quantifier and register automata. In LICS, pages 17-26. IEEE, 2006.
7. S. Demri, R. Lazić, and D. Nowak. On the freeze quantifier in constraint LTL: decidability and complexity. I & C, 205(1):2-24, 2007.
8. J. Esparza. On the decidability of model checking for several μ-calculi and Petri nets. In CAAP'94, volume 787 of LNCS, pages 115-129. Springer, 1994.
9. M. Fitting. Modal logic between propositional and first-order. JLC, 12(6):1017-1026, 2002.
10. P. Gastin and D. Kuske. Satisfiability and model checking for MSO-definable temporal logics are in PSPACE. In CONCUR'03, volume 2761 of LNCS, pages 222-236. Springer, 2003.
11. V. Goranko. Hierarchies of modal and temporal logics with references pointers. Journal of Logic, Language, and Information, 5:1-24, 1996.
12. Th. Henzinger. Half-order modal logic: how to prove real-time properties. In PODC'90, pages 281-296. ACM, 1990.
13. R.R. Howell and L.E. Rosier. Problems concerning fairness and temporal logic for conflict-free Petri nets. TCS, 64:305-329, 1989.
14. P. Jančar. Decidability of a temporal logic problem for Petri nets. TCS, 74(1):71-93, 1990.
15. O. Kupferman and M. Vardi. Memoryful Branching-Time Logic. In LICS'06, pages 265-274. IEEE, 2006.
16. R. Lazić. Safely freezing LTL. In FST&TCS'06, volume 4337, pages 381-392. LNCS, 2006.
17. F. Laroussinie, N. Markey, and Ph. Schnoebelen. Temporal logic with forgettable past. In LICS'02, pages 383-392. IEEE, 2002.
18. A. Lisitsa and I. Potapov. Temporal logic with predicate λ-abstraction. In TIME'05, pages 147-155. IEEE, 2005.
19. A. Rabinovich. Decidability and expressive power of real time logics. In FORMATS'06, volume 4202 of LNCS, page 32. Springer, 2006. Invited talk.
20. L. Segoufin. Automata and logics for words and trees over an infinite alphabet. In CSL'06, volume 4207 of LNCS, pages 41-57. Springer, 2006.
21. B. ten Cate and M. Franceschet. On the complexity of hybrid logics with binders. In CSL '05, volume 3634 of LNCS, pages 339-354. Springer, 2005.
22. M. Vardi and P. Wolper. Reasoning about infinite computations. I & C, 115:1-37, 1994.
23. F. Wolter and M. Zakharyaschev. Spatio-temporal representation and reasoning based on RCC-8. In KR'00, pages 3-14. Morgan Kaufmann, 2000.