On the decidability of metric temporal logic

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2005, Pages 188-197

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b Tulane University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATION; COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; REAL TIME SYSTEMS; SPECIFICATIONS;

METRIC TEMPORAL LOGIC (MTL); MODEL-CHECKING PROBLEM; TIME-BOUNDED RESPONSE PROPERTIES;

FORMAL LOGIC;

EID: 26844525115     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. 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, to appear, 2005.
2. P. A. Abdulla and B. Jonsson. Undecidable verification problems with unreliable channels. Information and Computation, 130:71-90, 1996.
3. P. A. Abdulla, B. Jonsson. Model checking of systems with many identical timed processes. Theoretical Computer Science. 290(1):241-264, 2003.
4. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126:183-235, 1994.
5. R. Alur, T. Feder and T. A. Henzinger. The benefits of relaxing punctuality. Journal of the ACM, 43:116-146, 1996.
6. 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.
7. R. Alur and T. A. Henzinger. Real-time logics: complexity and expressiveness. Information and Computation, 104:35-77, 1993.
8. R. Alur and T. A. Henzinger. A really temporal logic. Journal of the ACM, 41:181-204, 1994.
9. J. A. Brzozowski and E. Leiss. Finite automata and sequential networks. Theoretical Computer Science, 10:19-35, 1980.
10. 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.
11. A. K. Chandra, D. C. Kozen and L. J. Stockmeyer. Alternation. Journal of the ACM, 28(1): 114-133, 1981.
12. A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
13. T. A. Henzinger. The temporal specification and verification of real-time systems. Ph.D. Thesis, Technical Report STAN-CS-91-1380, Stanford University, 1991.
14. T. A. Henzinger. Sooner is safer than later. Information Processing Letters, 43:135-141, 1992.
15. T. A. Henzinger. It's about time: Real-time logics reviewed. In Proceedings of CONCUR 98, LNCS 1466, 1998.
16. T. A. Henzinger, Z. Manna and A. Pnueli. What good are digital clocks? In Proceedings of ICALP 92, LNCS 623, 1992.
17. T. A. Henzinger, J.-F. Raskin, and P.-Y. Shobbens. The regular real-time languages. In Proceedings of ICALP 98, LNCS 1443, 1998.
18. P. Hermann. Timed automata and recognizability. Information Processing Letters, 65:313-318, 1998.
19. G. Higman. Ordering by divisibility in abstract algebras. Proc. of the London Mathematical Society, 2:236-366, 1952.
20. R. Koymans. Specifying real-time properties with metric temporal logic. Real-time Systems, 2(4):255-299, 1990.
21. S. Lasota and I. Walukiewicz. Alternating timed automata. In Proceedings of FOSSACS 05, LNCS 3441, 2005.
22. S. Lasota and I. Walukiewicz. Personal communication, 2005.
23. J. Ostroff. Temporal logic of real-time systems. Research Studies Press, Taunton, England.
24. 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.
25. J.-F. Raskin and P.-Y. Schobbens. State-clock logic: a decidable real-time logic. In Proceedings of HART 97, LNCS 1201, 1997.
26. P. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Information Processing Letters, 83(5):251-261, 2002.
27. M. Vardi. Alternating automata: Unifying truth and validity checking for temporal logics. In Proceedings of CADE 97, LNCS 1249, 1997.
28. 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.