D. [. Alur, . Dillafh94-]-r, L. Alur, T. A. Fix, and . Henzinger, A theory of timed automata, CAV'94, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

R. Alur, S. L. Torre, and P. Madhusudan, Perturbed Timed Automata, HSCC'05, pp.70-85, 2005.
DOI : 10.1007/978-3-540-31954-2_5
URL : http://repository.upenn.edu/cgi/viewcontent.cgi?article=1166&context=cis_papers

E. Asarin, O. Maler, A. Pnueli, and J. Sifakis, Controller Synthesis for Timed Automata 1, SSC'98, pp.469-474, 1998.
DOI : 10.1016/S1474-6670(17)42032-5

. Ch, N. Baier, P. Bertrand, T. Bouyer, and . Brihaye, When are timed automata determinizable?, ICALP'09, pp.43-54, 2009.

P. Bouyer, C. Dufourd, E. Fleury, and A. Petit, Updatable timed automata, Theoretical Computer Science, vol.321, issue.2-3, pp.291-345, 2004.
DOI : 10.1016/j.tcs.2004.04.003
URL : https://hal.archives-ouvertes.fr/hal-00350196

M. Boja´nczykboja´nczyk and S. Lasota, A machine-independent characterization of timed languages, ICALP'12, pp.92-103, 2012.

N. Bertrand, A. Stainer, T. Jéron, M. Krichendm02, ]. Souza et al., A game approach to determinize timed automata, STACS'02 FORMATS-FTRTFT'04 FORMATS'06 LICS'04Tri06] S. Tripakis. Folk theorems on the determinization and minimization of timed automata. Information Processing Letters, pp.42-80, 2002.
DOI : 10.1023/B:FORM.0000026093.21513.31
URL : https://hal.archives-ouvertes.fr/inria-00629179

P. , V. Suman, P. K. Pandya, S. N. Krishna, and L. Manasa, Timed automata with integer resets: Language inclusion and expressiveness, FORMATS'08, pp.78-92, 2008.
DOI : 10.1007/978-3-540-85778-5_7