A Calculus for Timed Automata
| Title | A Calculus for Timed Automata |
| Publication Type | Report |
| Year of Publication | 1996 |
| Authors | D'Argenio, PR, Brinksma, E |
| Series Title | Technical Report CTIT |
| Document Number | 96-13 |
| Institution | University of Twente |
| Abstract | A language for representing timed automata is introduced. Its semantics is defined in terms of timed automata. This language is complete in the sense that any timed automaton can be represented by a term in the language. We also define a direct operational semantics for the language in terms of (timed) transition systems. This is proven to be equivalent (or, more precisely, timed bisimilar) to the interpretation in terms of timed automata. In addition, a set of axioms is given that is shown to be sound for timed bisimulation. Finally, we introduce several features like hiding operator, the parallel composition and derived time operations like wait, time-out and urgency. We conclude with an example and show that we can eliminate non-reachable states using algebraic techniques. (An extended abstract of this report has been published in FTRTFT'96, LNCS 1135, pp. 110-129, Springer 1996.) |
PDF (Full text):
