On MITL and alternating timed automata over infinite words

TL;DR

This paper extends one clock alternating timed automata (OCATA) with interval semantics to infinite words, enabling model-checking and satisfiability analysis for MITL, with practical algorithms and a prototype tool.

Contribution

It introduces interval semantics for OCATA over infinite words and develops region- and zone-based algorithms for MITL model-checking and satisfiability.

Findings

Prototype tool demonstrates practical performance.

Interval semantics effectively extend OCATA to infinite words.

Algorithms enable efficient MITL analysis.

Abstract

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 syntactic fragment of MTL), interpreted over infinite words. Our approach is based on the interval semantics (recently introduced in [BEG13] 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.