On metric temporal logic and faulty turing machines

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

Volumn 3921 LNCS, Issue , 2006, Pages 217-230

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; FAULT TOLERANT COMPUTER SYSTEMS; MATHEMATICAL MODELS; PROBLEM SOLVING; REAL TIME SYSTEMS; TURING MACHINES;

'INSERTION CHANNEL MACHINES; LINEAR TEMPORAL LOGIC; METRIC TEMPORAL LOGIC (MTL);

FORMAL LOGIC;

EID: 33745788757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11690634_15     Document Type: Conference Paper

References (24)

1. P. Abdulla and B. Jonsson. Undecidable verification problems with unreliable channels. Inf. Comput., 130:71-90, 1996.
2. P. A. Abdulla, J. Deneux, J. Ouaknine, and J. Worrell. Decidability and complexity results for timed automata via channel machines. In Proc. ICALP, volume 3580 of Springer LNCS, 2005.
3. R. Alur and D. Dill. A theory of timed automata. Theor. Comput. Sci., 126: 183-235, 1994.
4. R. Alur, T. Feder, and T. A. Henzinger. The benefits of relaxing punctuality. J. ACM, 43:116-146, 1996.
5. R. Alur and T. A. Henzinger. Logics and models of real time: A survey. In Proc. RTTP, volume 600 of Springer LNCS, 1992.
6. R. Alur and T. A. Henzinger. Real-time logics: Complexity and expressiveness. Inf. Comput., 104:35-77, 1993.
7. R. Alur and T. A. Henzinger. A really temporal logic. J. ACM, 41:181-204, 1994.
8. D. Brand and P. Zafiropulo. On communicating finite-state machines. J. ACM, 30(2):323-342, 1983.
9. G. Cécé, A. Finkel, and S. P. Iyer. Unreliable channels are easier to verify than perfect channels. Inf. Comput., 124:20-31, 1996.
10. A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theor. Comput. Sci., 256(1-2):63-92, 2001.
11. T. A. Henzinger. The Temporal Specification and Verification of Real-Time Systems. PhD thesis, Stanford University, 1991. Tech. rep. STAN-CS-91-1380.
12. T. A. Henzinger. It's about time: Real-time logics reviewed. In Proc. CONCUR, volume 1466 of Springer LNCS, 1998.
13. T. A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In Proc. ICALP, volume 623 of Springer LNCS, 1992.
14. T. A. Henzinger, J.-K. Raskin, and P.-Y. Schobbens. The regular real-time languages. In Proc. ICALP, volume 1443 of Springer LNCS, 1998.
15. Y. Hirshfeld and A. Rabinovich. Logics for real time: Decidability and complexity. Fundam. Inform., 62(1):1-28, 2004.
16. R. Koymans. Specifying real-time properties with metric temporal logic. Real-time Systems, 2(4):255-299, 1990.
17. S. Lasota and I. Walukiewicz. Personal communication, 2005.
18. S. Lasota and I. Walukiewicz. Alternating timed automata. In Proc. FOSSACS, volume 3441 of Springer LNCS, 2005.
19. J. Ouaknine and J. Worrell. On the decidability of metric temporal logic. In Proc. LICS. IEEE Press, 2005.
20. J. Ouaknine and J. Worrell. Safety metric temporal logic is fully decidable. Submitted, 2005.
21. J.-F. Raskin and P.-Y. Schobbens. State-clock logic: A decidable real-time logic. In Proc. HART, volume 1201 of Springer LNCS, 1997.
22. K. Schneider. Verification of Reactive Systems. Springer, 1997.
23. P. Schnoebelen. Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett., 83(5):251-261, 2002.
24. T. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In Proc. FTRTFTS, volume 863 of Springer LNCS, 1994.