The cost of punctuality

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2007, Pages 109-118

  Bouyer, Patricia ^a   Markey, Nicolas ^a   Ouaknine, Joël ^b   Worrell, James ^b  

^a CNRS   (France)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROCEDURE; FINITE-STATE AUTOMATA; INTERVAL TEMPORAL LOGIC; LARGE CLASS; LINEAR TIME TEMPORAL LOGIC; METRIC TEMPORAL LOGIC; MODEL CHECKING PROBLEM; NON-PRIMITIVE RECURSIVE COMPLEXITY; REAL-TIME LOGIC; SATISFIABILITY; TIMING CONSTRAINTS; UNDECIDABILITY;

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; LINEARIZATION; MODEL CHECKING; SPECIFICATIONS; TIMING CIRCUITS; TURING MACHINES;

TEMPORAL LOGIC;

EID: 82755183397     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2007.49     Document Type: Conference Paper

References (25)

1. R. Alur and D. Dill. A theory of timed automata. Theoretical Computer Science, 126(2):183-235, 1994.
2. R. Alur, T. Feder, and T. A. Henzinger. The benefits of relaxing punctuality. Journal ACM, 43(1):116-146, 1996. (Pubitemid 126607636)
3. R. Alur and T. A. Henzinger. Logics and models of Real-Time: a survey. In Real-Time: Theory in Practice, Proc. REX Workshop 1991, vol. 600 of LNCS, pp. 74-106. Springer, 1992.
4. R. Alur and T. A. Henzinger. Real-time logics: Complexity and expressiveness. Information and Computation, 104(1):35-77, 1993.
5. R. Alur and T. A. Henzinger. A really temporal logic. Journal of the ACM, 41(1):181-204, 1994.
6. P. Bouyer, N. Markey, J. Ouaknine, Ph. Schnoebelen, and J. Worrell. On the complexity of termination in faulty channel machines. 2007. Submitted.
7. P. Bouyer, N. Markey, J. Ouaknine, and J. Worrell. The cost of punctuality. Research report LSV-07-05, Lab. Spécification & Vérification, ENS Cachan, France, 2007.
8. D. Brand and P. Zafiropulo. On communicating finite-state machines. Journal of the ACM, 30(2):323-342, 1983.
9. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In Proc. 32nd Annual Symp. on Found. of Computer Science (FOCS'91), pp. 368-377. IEEE Comp. Soc. Press, 1991.
10. T. A. Henzinger. The Temporal Specification and Verification of Real-Time Systems. PhD thesis, Stanford University, CA, USA, 1991.
11. T. A. Henzinger. It's about time: Real-time logics reviewed. In Proc. 9th Int. Conf. on Concurr. Theory (CONCUR'98), vol. 1466 of LNCS, pp. 439-454. Springer, 1998. (Pubitemid 128125373)
12. T. A. Henzinger, Z. Manna, and A. Pnueli. What good are digital clocks? In Proc. 19th Int. Coll. on Automata, Languages and Programming (ICALP'92), vol. 623 of LNCS, pp. 545-558. Springer, 1992.
13. Y. Hirshfeld and A. M. Rabinovich. Logics for real time: Decidability and complexity. Fundamenta Informaticae, 62(1):1-28, 2004.
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 Proc. 8th Int. Conf. on Found. of Software Science and Computation Structures (FoSSaCS'05), vol. 3441 of LNCS, pp. 250-265. Springer, 2005. (Pubitemid 41273711)
16. O. Maler, D. Nickovic, and A. Pnueli. From MITL to timed automata. In Proc. 4th Int. Conf. on Formal Modeling and Analysis of Timed Systems (FORMATS'06), vol. 4202 of LNCS, pp. 274-189. Springer, 2006.
17. S. Miyano and T. Hayashi. Alternating finite automata on omega-words. Theoretical Computer Science, 32:321-330, 1984.
18. J. Ouaknine and J. Worrell. On the language inclusion problem for timed automata: Closing a decidability gap. In Proc. 19th Annual Symp. on Logic in Computer Science (LICS'04), pp. 54-63. IEEE Comp. Soc. Press, 2004.
19. J. Ouaknine and J. Worrell. On the decidability of Metric Temporal Logic. In Proc. 19th Annual Symp. on Logic in Computer Science (LICS'05), pp. 188-197. IEEE Comp. Soc. Press, 2005. (Pubitemid 41462566)
20. J. Ouaknine and J. Worrell. On Metric Temporal Logic and faulty Turing machines. In Proc. 9th Int. Conf. on Found. of Software Science and Computation Structures (FoSSaCS'06), vol. 3921 of LNCS, pp. 217-230. Springer, 2006. (Pubitemid 44019342)
21. J. Ouaknine and J. Worrell. Safety Metric Temporal Logic is fully decidable. In Proc. 12th Int. Conf. on Tools and Algorithms for the Constr. and Analysis of Systems (TACAS'06), vol. 3920 of LNCS, pp. 411-425. Springer, 2006. (Pubitemid 44019385)
22. J. Ouaknine and J. Worrell. On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Computer Science, 3(1), 2007.
23. J.-F. Raskin. Logics, Automata and Classical Theories for Deciding Real Time. PhD thesis, Université de Namur, Belgium, 1999.
24. M. Y. Vardi. An automata-theoretic approach to Linear Temporal Logic. In Proc. Logics for Concurr.: Structure versus Automata, vol. 1043 of LNCS, pp. 238-266. Springer, 1996. (Pubitemid 126047609)
25. Th. Wilke. Specifying timed state sequences in powerful decidable logics and timed automata. In Proc. 3rd Int. Symp. on Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'94), vol. 863 of LNCS, pp. 694-715. Springer, 1994.