On the decidability and complexity of metric temporal logic over finite words

Logical Methods in Computer Science

Volumn 3, Issue 1, 2007, Pages

  Ouaknine, Joël ^a   Worrell, James ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Alternating automata; Metric temporal logic; Timed automata; Well quasiorders

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS; FORMAL LOGIC; LINEARIZATION; TEMPORAL LOGIC;

ALTERNATING AUTOMATA; INFINITE WORD; METRIC TEMPORAL LOGIC; MODEL CHECKING PROBLEM; NON-PRIMITIVE RECURSIVE COMPLEXITY; SATISFIABILITY PROBLEMS; TIME-BOUNDED RESPONSE PROPERTIES; TIMED AUTOMATA;

MODEL CHECKING;

EID: 84987860312     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(1:8)2007     Document Type: Article

References (35)

1. P. A. Abdulla, K. Čerāns, B. Jonsson, and T. Yih-Kuen. General decidability theorems for infinite-state systems. In Proceedings of LICS 96, IEEE Computer Society Press, 1996.
2. P. A. Abdulla, J. Deneux, J. Ouaknine, and J. Worrell. Decidability and complexity results for timed automata via channel systems. In Proceedings of ICALP 05, LNCS 3580, 2005.
3. P. A. Abdulla and B. Jonsson. Undecidable verification problems with unreliable channels. Information and Computation 130:71-90, 1996.
4. P. A. Abdulla and B. Jonsson. Model checking of systems with many identical timed processes. Theoretical Computer Science 290(1):241-264, 2003.
5. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science 126:183-235, 1994.
6. R. Alur, T. Feder, and T. A. Henzinger. The benefits of relaxing punctuality. In Proceedings of PODC 91, ACM Press, 1991.
7. R. Alur, T. Feder and T. A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM 43:116-146, 1996.
8. R. Alur and T. A. Henzinger. Logics and models of real time: A survey. In Proceedings of Real Time: Theory in Practice, LNCS 600, 1992.
9. R. Alur and T. A. Henzinger. Real-time logics: complexity and expressiveness. Information and Computation 104:35-77, 1993.
10. R. Alur and T. A. Henzinger. A really temporal logic. Journal of the ACM 41:181-204, 1994.
11. J. A. Brzozowski and E. Leiss. Finite automata and sequential networks. Theoretical Computer Science 10:19-35, 1980.
12. G. Cécé, A. Finkel, and S. Purushothaman Iyer. Unreliable channels are easier to verify than perfect channels. Information and Computation 124:20-31, 1996.
13. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM 28(1):114-133, 1981.
14. M. Dickhöfer and T. Wilke. Timed alternating tree automata: the automata-theoretic solution to the TCTL model checking problem. In Proceedings of ICALP 99, LNCS 1644, 1999.
15. A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science 256(1-2):63-92, 2001.
16. T. A. Henzinger. The temporal specification and verification of real-time systems. Ph.D. Thesis, Technical Report STAN-CS-91-1380, Stanford University, 1991.
17. T. A. Henzinger. Sooner is safer than later. Information Processing Letters 43:135-141, 1992.
18. T. A. Henzinger. It’s about time: Real-time logics reviewed. In Proceedings of CONCUR 98, LNCS 1466, 1998.
19. T. A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In Proceedings of ICALP 92, LNCS 623, 1992.
20. Y. Hirshfeld and A. M. Rabinovich: Logics for Real Time: Decidability and Complexity. Fundam. Inform. 62(1):1-28, 2004.
21. T. A. Henzinger, J.-F. Raskin, and P.-Y. Shobbens. The regular real-time languages. In Proceedings of ICALP 98, LNCS 1443, 1998.
22. P. Hermann. Timed automata and recognizability. Information Processing Letters 65:313-318, 1998.
23. G. Higman. Ordering by divisibility in abstract algebras. Proc. of the London Mathematical Society 2:236-366, 1952.
24. R. Koymans. Specifying real-time properties with metric temporal logic. Real-time Systems 2(4):255-299, 1990.
25. S. Lasota and I. Walukiewicz. Alternating timed automata. In Proceedings of FOSSACS 05, LNCS 3441, 2005.
26. S. Lasota and I. Walukiewicz. Personal communication, 2005.
27. J. Ostroff. Temporal logic of real-time systems. Research Studies Press, Taunton, England.
28. J. Ouaknine and J. Worrell. On the language inclusion problem for timed automata: Closing a decidability gap. In Proceedings of LICS 04, IEEE Computer Society Press, 2004.
29. J. Ouaknine and J. Worrell. On the decidability of metric temporal logic. In Proceedings of LICS 05, IEEE Computer Society Press, 2005.
30. J. Ouaknine and J. Worrell. Metric temporal logic and faulty Turing machines. In Proceedings of FOSSACS 06, LNCS 3921, 2006.
31. J. Ouaknine and J. Worrell. Safety metric temporal logic is fully decidable. In Proceedings of TACAS 06, LNCS 3920, 2006.
32. J.-F. Raskin and P.-Y. Schobbens. State-clock logic: a decidable real-time logic. In Proceedings of HART 97, LNCS 1201, 1997.
33. P. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters 83(5):251-261, 2002.
34. M. Vardi. Alternating automata: Unifying truth and validity checking for temporal logics. In Proceedings of CADE 97, LNCS 1249, 1997.
35. T. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS 863, 1994.