A calculus for timed automata (extended 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 sat of axioms is given that is shown to be sound for timed bisimulation. Finally, eve Introduce several features including the parallel composition and derived time operations like wait, time-out and urgency. We conclude with an example and show that pie can eliminate non-reachable states using algebraic techniques.