an:01238418
Zbl 0912.68132
Alur, Rajeev; Fix, Limor; Henzinger, Thomas A.
Event-clock automata: a determinizable class of timed automata
EN
Theor. Comput. Sci. 211, No. 1-2, 253-273 (1999).
00053976
1999
j
68Q60 68Q45
formal verification; automata theory; real-time systems; timed automata
Summary: We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event \(a\), a clock that records the time of the last occurrence of \(a\). The class of event-recording automata is, on one hand, expressive enough to model (finite) timed transition systems and, on the other hand, determinizable and closed under all boolean operations. As a result, the language-inclusion problem is decidable for event-recording automata. We present a translation from timed transition systems to event-recording automata, which leads to an algorithm for checking if two timed transition systems have the same set of timed behaviors. We also consider event-predicting automata, which contain clocks that predict the time of the next occurrence of an event. The class of event-clock automata, which contain both event-recording and event-predicting clocks, is a suitable specification language for real-time properties. We provide an algorithm for checking if a timed automaton meets a specification that is given as an event-clock automaton.