Event Clock Automata: From Theory to Practice
Event clock automata (ECA ) are a model for timed languages that has been introduced by Alur, Fix and Henzinger as an alternative to timed automata, with better theoretical properties (for instance, ECA are determinizable while timed automata are not). In this paper, we revisit and extend the theory of ECA. We first prove that no finite time abstract language equivalence exists for ECA, thereby disproving a claim in the original work on ECA. This means in particular that regions do not form a time abstract bisimulation. Nevertheless, we show that regions can still be used to build a finite automaton recognizing the untimed language of an ECA . Then, we extend the classical notions of zones and DBMs to let them handle event clocks instead of plain clocks (as in timed automata) by introducing event zones and Event DBMs (EDBMs). We discuss algorithms to handle event zones represented as EDBMs, as well as (semi-) algorithms based on EDBMs to decide language emptiness of ECA.
KeywordsNormal Form Widening Operator Clock Constraint Initial Valuation Pushdown Automaton
Unable to display preview. Download preview PDF.
- 4.Behrmann, G., David, A., Larsen, K.G., Håkansson, J., Pettersson, P., Yi, W., Hendriks, M.: Uppaal 4.0. In: Proceedings of QEST 2006, pp. 125–126. IEEE Computer Society, Los Alamitos (2006)Google Scholar
- 13.Geeraerts, G., Raskin, J.-F., Sznajder, N.: Event-Clock Automata: from Theory to Practice. Technical report., http://arxiv.org/abs/1107.4138
- 15.Sorea, M.: Tempo: A model-checker for event-recording automata. In: Proceedings of RT-TOOLS 2001, Aalborg, Denmark (August 2001)Google Scholar