On MITL and alternating timed automata

Preprint English OPEN
Brihaye, Thomas; Estiévenart, Morgane; Geeraerts, Gilles;
  • Subject: Computer Science - Formal Languages and Automata Theory | 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 recently introduced as natural extension of (one clock) timed automata to express the semantics of MTL (Ouaknine, Worrell 2005). We consider the application of OCATA to problem of model-checking MITL formulas (a synta... View more
  • References (13)
    13 references, page 1 of 2

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

    [2] R. Alur, T. Feder, and T. A. Henzinger. The benefits of relaxing punctuality. J. ACM, 43(1):116-146, 1996.

    [3] J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. Inf. Comput., 98(2):142-170, 1992.

    [4] E. M. Clarke, O. Grumberg, and D. Peled. Model checking. MIT Press, 2001.

    [5] M. De Wulf, L. Doyen, N. Maquet, and J.-F. Raskin. Antichains: Alternative algorithms for LTL satisfiability and model-checking. In TACAS, volume 4963 of LNCS. Springer, 2008.

    [6] L. Doyen and J.-F. Raskin. Antichain algorithms for finite automata. In TACAS, volume 6015 of LNCS. Springer, 2010.

    [7] T. A. Henzinger. The temporal specification and verification of real-time systems. PhD thesis, Standford University, 1991.

    [8] R. Koymans. Specifying real-time properties with metric temporal logic. RealTime Systems, 2(4):255-299, 1990.

    [9] S. Lasota and I. Walukiewicz. Alternating timed automata. ACM Trans. Comput. Log., 9(2), 2008.

    [10] O. Maler, D. Nickovic, and A. Pnueli. From mitl to timed automata. In FORMATS, volume 4202 of LNCS. Springer, 2006.

  • Similar Research Results (2)
  • Metrics
    No metrics available
Share - Bookmark