Safety metric temporal logic is fully decidable

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

Volumn 3920 LNCS, Issue , 2006, Pages 411-425

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; CONSTRAINT THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS;

LINEAR TEMPORAL LOGIC; METRIC TEMPORAL LOGIC (MTL); SAFETY MTL; TIME-BOUNDED RESPONSE;

INVARIANCE;

EID: 33745777623     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691372_27     Document Type: Conference Paper

References (22)

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 3580, 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. Real-time logics: complexity and expressiveness. Information and Computation, 104:35-77, 1993.
7. R. Alur and T. A. Henzinger. A really temporal logic. Journal of the ACM, 41:181-204, 1994.
8. P. Bouyer, F. Chevalier and N. Markey. On the expressiveness of TPTL and MTL. Research report LSV-2005-05, Lab. Spécification et Vérification, May 2005.
9. A. Finkel and P. Schnoebelen. Well-structured transition systems everywhere! Theoretical Computer Science, 256(1-2):63-92, 2001.
10. T. A. Henzinger. It's about time: Real-time logics reviewed. In Proceedings of CONCUR 98, LNCS 1466, 1998.
11. T. A. Henzinger, Z. Manna and A. Pnueli. What good are digital clocks? In Proceedings of ICALP 92, LNCS 623, 1992.
12. T. A. Henzinger, J.-F. Raskin, and P.-Y. Schobbens. The regular real-time languages. In Proceedings of ICALP 98, LNCS 1443, 1998.
13. G. Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society, 2:236-366, 1952.
14. R. Koymans. Specifying real-time properties with metric temporal logic. Real-time Systems, 2(4):255-299, 1990.
15. S. Lasota and I. Walukiewicz. Alternating timed automata. In Proceedings of FOSSACS 05, LNCS 3441, 2005.
16. J. Ouaknine and J. Worrell. On the decidability of Metric Temporal Logic. In Proceedings of LICS 05, IEEE Computer Society Press, 2005.
17. J. Ouaknine and J. Worrell. Metric temporal logic and faulty Turing machines. Proceedings of FOSSACS 06, LNCS, 2006.
18. J. Ouaknine and J. Worrell. Safety MTL is fully decidable. Oxford University Programming Research Group Research Report RR-06-02.
19. J.-F. Raskin and P.-Y. Schobbens. State-clock logic: a decidable real-time logic. In Proceedings of HART 97, LNCS 1201, 1997.
20. M. Vardi. Alternating automata: Unifying truth and validity checking for temporal logics. In Proceedings of CADE 97, LNCS 1249, 1997.
21. F. Wang. Formal Verification of Timed Systems: A Survey and Perspective. Proceedings of the IEEE, 92(8):1283-1307, 2004.
22. 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.