On MITL and alternating timed automata over infinite words

Preprint English OPEN
Brihaye, Thomas; Estiévenart, Morgane; Geeraerts, Gilles;
  • Subject: Mathematics - Logic | Computer Science - Logic in Computer Science
    arxiv: Computer Science::Formal Languages and Automata Theory | Computer Science::Logic in Computer Science

One clock alternating timed automata (OCATA) have been introduced as natural extension of (one clock) timed automata to express the semantics of MTL. In this paper, we consider the application of OCATA to the problems of model-checking and satisfiability for MITL (a syn... View more
  • References (8)

    1. R. Alur and D. L. Dill. A theory of timed automata. Theor. Comput. Sci., 126(2):183{235, 1994.

    2. P. A. Abdulla, J. Deneux, J. Ouaknine, K. Quaas and J. Worrell. Universality Analysis for One-Clock Timed Automata. Fundam. Inform., 89(4):419{450, 2008.

    3. R. Alur, T. Feder and T. A. Henzinger. The bene ts of relaxing punctuality. J. ACM, 43(1):116{146, 1996.

    4. P. Bouyer. Timed Automata may cause some troubles. Research Report LSV-02-9, Lab. Speci cation et Veri cation, CNRS & ENS de Cachan, France, 2002.

    5. T. Brihaye, M. Estievenart and G. Geeraerts. On MITL and Alternating Timed Automata. In FORMATS, volume 8053 of LNCS. Springer, 2013.

    6. J. Bengtsson and W. Yi. Timed Automata: Semantics, Algorithms and Tools. Lectures on Concurrency and Petri Nets 87-124, 2003.

    7. E. M. Clarke, O. Grumberg, and D. Peled. Model checking. MIT Press, 2001.

    8. C. Daws and S. Yovine. Reducing the number of clock variables of timed automata. Real-Time Systems, 73-81, 1996.

  • Metrics
Share - Bookmark