Event-Clock Automata: A Determinizable Class of Timed Automata

DMCA

Event-Clock Automata: A Determinizable Class of Timed Automata (1999)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Rajeev Alur , Limor Fix , Thomas A. Henzinger

Venue:	Theoretical Computer Science
Citations:	118 - 2 self

BibTeX

@ARTICLE{Alur99event-clockautomata:,
    author = {Rajeev Alur and Limor Fix and Thomas A. Henzinger},
    title = {Event-Clock Automata: A Determinizable Class of Timed Automata},
    journal = {Theoretical Computer Science},
    year = {1999},
    volume = {211},
    pages = {1--13}
}

OpenURL

Abstract

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 automa...

Keyphrases

event-recording automaton timed automaton event-clock automaton determinizable class transition system last occurrence event-predicting clock real-time property next occurrence timed behavior boolean operation event-predicting automaton timed transition system timed automa suitable specification language language inclusion problem

DMCA