A. , R. Alur, and D. L. Dill, universalité est indécidable, 3. leprobì eme de l'inclusion de traces est indécidable, 4. les TA ne sont pas clos par passage au complémentaire A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.

R. Alur, L. Fix, and T. A. Henzinger, A determinizable class of timed automata, Proceedings of International Conference on Computer Aided Verification (CAV'94), pp.1-13, 1994.
DOI : 10.1007/3-540-58179-0_39

R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi, Alternating refinement relations, Proceedings of International Conference on Concurrency Theory (CONCUR'98), volume 1466 of Lecture Notes in Computer Science, pp.163-178, 1998.
DOI : 10.1007/BFb0055622

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.113.1421

L. , B. Briones, and E. Brinksma, A test generation framework for quiescent real-time systems, Proceedings of International Workshop, Formal Approaches to Software Testing, 2004.

N. [. Baier, P. Bertrand, T. Bouyer, and . Brihaye, When Are Timed Automata Determinizable?, Proceedings of International Colloquium on Automata, Languages and Programming, pp.43-54, 2009.
DOI : 10.1007/978-3-642-02930-1_4

URL : https://hal.archives-ouvertes.fr/inria-00424351

F. [. Bouyer, D. Chevalier, and . Souza, Fault Diagnosis Using Timed Automata, Proceedings of International Conference on Foundations of Software Science and Computational Structures (FOSSACS'05), pp.219-233, 2005.
DOI : 10.1007/978-3-540-31982-5_14

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.7570

B. Bérard, V. Diekert, P. Gastin, and A. Petit, Characterization of the expressive power of silent transitions in timed automata, Fundamenta Informaticae, vol.36, issue.2 3, pp.145-182, 1998.

]. P. Bou09 and . Bouyer, From Qualitative to Quantitative Analysis of Timed Systems. Mémoire d'habilitation, 2009.

]. A. Dll-+-10, K. G. David, A. Larsen, U. Legay, A. Nyman et al., Timed i/o automata : a complete specification theory for real-time systems, Proceedings of International Conference on Hybrid Systems : Computation and Control (HSCC'10), pp.91-100, 2010.

S. [. Daws and . Yovine, Reducing the number of clock variables of timed automata, 17th IEEE Real-Time Systems Symposium, pp.73-81, 1996.
DOI : 10.1109/REAL.1996.563702

T. [. Jeannet, V. Jéron, E. Rusu, and . Zinovieva, Symbolic Test Selection Based on Approximate Analysis, Proceedings of International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'05), pp.349-364, 2005.
DOI : 10.1007/978-3-540-31980-1_23

URL : https://hal.archives-ouvertes.fr/inria-00564617

S. [. Krichen and . Tripakis, Conformance testing for real-time systems, Formal Methods in System Design, vol.10, issue.1???2, pp.238-304, 2009.
DOI : 10.1007/s10703-009-0065-1

A. [. Nielsen and . Skou, Automated test generation from timed automata, International Journal on Software Tools for Technology Transfer, vol.5, 2003.

[. Suman, P. K. Pandya, L. Shankara-narayanan-krishna, and . Manasa, Timed Automata with Integer Resets: Language Inclusion and Expressiveness, Proceedings of International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'08), pp.78-92, 2008.
DOI : 10.1007/978-3-540-85778-5_7

J. [. Schmaltz and . Tretmans, On Conformance Testing for Timed Systems, Proceedings of International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'08), pp.250-264, 2008.
DOI : 10.1007/978-3-540-85778-5_18

]. J. Tre96 and . Tretmans, Test generation with inputs, outputs and repetitive quiescence, Software-Concepts and Tools, pp.103-120, 1996.

]. S. Tri06 and . Tripakis, Folk theorems on the determinization and minimization of timed automata, Information Processing Letters, vol.99, issue.6, pp.222-226, 2006.