Abstract
One clock alternating timed automata (OCATA) have been introduced as natural extension of (one clock) timed automata to express the semantics of MTL [15]. In this paper, we consider the application of OCATA to the problems of model-checking and satisfiability for MITL (a syntactic fragment of MTL), interpreted over infinite words. Our approach is based on the interval semantics (recently introduced in [5] in the case of finite words) extended to infinite words. We propose region-based and zone-based algorithms, based on this semantics, for MITL model-checking and satisfiability. We report on the performance of a prototype tool implementing those algorithms. © 2014 Springer International Publishing Switzerland.
Cite
CITATION STYLE
Brihaye, T., Estiévenart, M., & Geeraerts, G. (2014). On MITL and alternating timed automata over infinite words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8711 LNCS, pp. 69–84). Springer Verlag. https://doi.org/10.1007/978-3-319-10512-3_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
