Safely freezing LTL

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

Volumn 4337 LNCS, Issue , 2006, Pages 381-392

  Lazić, Ranko ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY; TEMPORAL LOGIC;

COUNTER AUTOMATA; DECISION PROBLEMS; FREEZE QUANTIFIERS; INFINITE DOMAINS; LINEAR TEMPORAL LOGIC; MODEL CHECKING PROBLEM; TEMPORAL OPERATORS; UNDECIDABILITY;

MODEL CHECKING;

EID: 35448953757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944836_35     Document Type: Conference Paper

References (17)

1. Schnoebelen, P.: The complexity of temporal logic model checking. In: AiML’02. Volume 4 of Advances in Modal Logic., King’s College Publications (2003) 393–436
2. Lisitsa, A., Potapov, I.: Temporal logic with predicate λ-abstraction. In: TIME, IEEE (2005) 147–155
3. Bojańczyk, M., Muscholl, A., Schwentick, T., Segoufin, L., David, C.: Two-variable logic on words with data. In: LICS, IEEE (2006) 7–16
4. Bojańczyk, M., David, C., Muscholl, A., Schwentick, T., Segoufin, L.: Two-variable logic on data trees and XML reasoning. In: PODS, ACM (2006) 10–19
5. Ouaknine, J., Worrell, J.: On the decidability of Metric temporal logic. In: LICS, IEEE (2005) 188–197
6. French, T.: Quantified propositional temporal logic with repeating states. In: TIME-ICTL, IEEE (2003) 155–165
7. Demri, S., Lazić, R., Nowak, D.: On the freeze quantifier in constraint LTL: decidability and complexity. In: TIME, IEEE (2005) 113–121
8. Demri, S., Lazić, R.: LTL with the freeze quantifier and register automata. In: LICS, IEEE (2006) 17–26
9. Kaminski, M., Francez, N.: Finite-memory automata. TCS134(2) (1994) 329–363
10. Neven, F., Schwentick, T., Vianu, V.: Finite state machines for strings over infinite alphabets. ACM TOCL5(3) (2004) 403–435
11. Sistla, A.P.: Safety, liveness and fairness in temporal logic. Formal Aspects of Computing 6(5) (1994) 495–512
12. Ouaknine, J., Worrell, J.: Safety Metric temporal logic is fully decidable. In: TACAS. Volume 3920 of LNCS., Springer (2006) 411–425
13. Odifreddi, P.: Classical Recursion Theory II. Elsevier (1999)
14. David, C.: Mots et données infinies. Master’s thesis, LIAFA (2004)
15. Schnoebelen, P.: Deciding termination of ICMETs (2006) Personal communication.
16. Brzozowski, J.A., Leiss, E.L.: On equations for regular languages, finite automata, and sequential networks. TCS10(1) (1980) 19–35
17. Finkel, A., Schnoebelen, P.: Well-structured transitions systems everywhere!TCS256(1–2) (2001) 63–92