A determinizable class of timed automata

R. Alur, L. Fix, T.A. Henzinger, in:, Springer, 1994, pp. 1–13.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Author
; ;
Series Title
LNCS
Abstract
We introduce the class of event- recording timed automata (ERA). An event-recording automaton contains, for every event a, a clock that records the time of the last occurrence of a. The class ERA 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 timed automata (EPA), which contain clocks that predict the time of the next occurrence of an event. The class of event-clock automata (ECA), 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.
Publishing Year
Date Published
1994-01-01
Acknowledgement
Supported in part by the Office of Naval Research under contract N00014-91-J-1219, the National Science Foundation under grant CCR-8701103, and by DARPA/NSF under grant CCR-9014363. Supported in part by the National Science Foundation under grant CCR-9200794 and by the United States Air Force Office of Scientific Research under contract F49620-93-1-0056.
Volume
818
Page
1 - 13
Conference
CAV: Computer Aided Verification
IST-REx-ID

Cite this

Alur R, Fix L, Henzinger TA. A determinizable class of timed automata. In: Vol 818. Springer; 1994:1-13. doi:10.1007/3-540-58179-0_39
Alur, R., Fix, L., & Henzinger, T. A. (1994). A determinizable class of timed automata (Vol. 818, pp. 1–13). Presented at the CAV: Computer Aided Verification, Springer. https://doi.org/10.1007/3-540-58179-0_39
Alur, Rajeev, Limor Fix, and Thomas A Henzinger. “A Determinizable Class of Timed Automata,” 818:1–13. Springer, 1994. https://doi.org/10.1007/3-540-58179-0_39.
R. Alur, L. Fix, and T. A. Henzinger, “A determinizable class of timed automata,” presented at the CAV: Computer Aided Verification, 1994, vol. 818, pp. 1–13.
Alur R, Fix L, Henzinger TA. 1994. A determinizable class of timed automata. CAV: Computer Aided Verification, LNCS, vol. 818. 1–13.
Alur, Rajeev, et al. A Determinizable Class of Timed Automata. Vol. 818, Springer, 1994, pp. 1–13, doi:10.1007/3-540-58179-0_39.

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar