Eventual timed automata

Abstract

We study the class of timed automata called eventual timed automata (ETA's) obtained using guards based on the operator ◇. In this paper we show that ETA's form a decidable class of timed automata via a flattening to non-recursive ETA's followed by a reduction to 1-clock alternating timed automata. We also study the expressiveness of the class of ETA's and show that they compare favourably with other classes in the literature. Finally we show that class obtained using the dual operator is also decidable, though the two operators together lead to an undecidable class of languages. © Springer-Verlag Berlin Heidelberg 2005.