Counter-Free Input-Determined Timed Automata

Fabrice Chevalier, Deepak D'Souza and Pavithra Prabhakar

We identify a class of timed automata, which we call counter-free input-determined automata, which characterize the class of timed languages definable by several timed temporal logics in the literature, including MTL. We make use of this characterization to show that MTL+Past satisfies an “ultimate stability” property with respect to periodic sequences of timed words. Our results hold for both the pointwise and continuous semantics. Along the way we generalize the result of McNaughton-Papert to show a counter-free automata characterization of FO-definable finitely varying functions.

Formal Modeling and Analysis of Timed Systems, 5th International Conference (FORMATS), 2007
Download: BIB PS PDF