A Determinizable Class of Timed Automata
| dc.contributor.author | Alur, Rajeev | en_US |
| dc.contributor.author | Fix, Limor | en_US |
| dc.contributor.author | Henzinger, Thomas A. | en_US |
| dc.date.accessioned | 2007-04-23T18:00:59Z | |
| dc.date.available | 2007-04-23T18:00:59Z | |
| dc.date.issued | 1995-03 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 262653 bytes | |
| dc.format.extent | 317450 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR95-1492 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/7150 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | A Determinizable Class of Timed Automata | en_US |
| dc.type | technical report | en_US |