E. Asarin, P. Caspi, and O. Maler, A Kleene theorem for timed automata, IEEE Logic in Computer Science, pp.160-171, 1997.

E. Asarin, P. Caspi, and O. Maler, Timed regular expressions, Journal of the ACM, vol.49, issue.2, pp.172-206, 2002.
URL : https://hal.archives-ouvertes.fr/hal-01699969

R. Alur and D. L. Dill, A Theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.

, Eugene Asarin. Equations on timed languages. In HSCC, pp.1-12, 1998.

B. Bérard and C. Picaronny, Accepting zeno words: a way towards timed refinements, Acta Informatica, vol.37, issue.1, pp.45-81, 2000.

P. Bouyer and A. Petit, A Kleene/Büchi-like theorem for clock languages, Journal of Automata, Languages and Combinatorics, 2002.

C. Dima, Real-time automata and the Kleene algebra of sets of real numbers, STACS '00, vol.1770, pp.279-290, 2000.
URL : https://hal.archives-ouvertes.fr/hal-01699972

P. Herrmann, Renaming is necessary in timed regular expressions, FSTTCS '99, number 1738 in LNCS, pp.47-59, 1999.