Timed regular expressions

In this paper we define timed regular expressions, a formalism for specifying discrete behaviors augmented with timing information, and prove that its expressive power is equivalent to the timed automata of Alur and Dill. This result is the timed analogue of Kleene Theorem and, similarly to that result, the hard part in the proof is the translation from automata to expressions. This result is extended from finite to infinite (in the sense of B

• Type: Journal
• Year: 2002
• Where: JACM
• Authors: Eugene Asarin, Paul Caspi, Oded Maler
• Keywords: Behaviors, JACM 2002, Timed Analogue, Timed Automata