P. A. Abdulla, P. Krcál, and W. Yi, Sampled semantics of timed automata, Logical Methods in Computer Science, vol.6, issue.3, 2010.

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

E. Asarin and A. Degorre, Volume and Entropy of Regular Timed Languages: Analytic Approach, FORMATS. LNCS, pp.13-27, 2009.
DOI : 10.1016/0304-3975(94)90010-8

E. Asarin and A. Degorre, Volume and Entropy of Regular Timed Languages: Discretization Approach, In: CONCUR. LNCS, vol.1, issue.1, pp.69-83, 2009.
DOI : 10.1007/978-0-387-49820-1

E. Asarin and A. Degorre, Two size measures for timed languages, Schloss Dagstuhl -Leibniz-Zentrum für Informatik, pp.376-387, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00527852

E. Asarin, O. Maler, and A. Pnueli, On discretization of delays in timed automata and digital circuits, In: CONCUR. LNCS, vol.1466, pp.470-484, 1998.
DOI : 10.1007/BFb0055642

D. Beauquier, Pumping Lemmas for timed automata, FoSSaCS. LNCS, pp.81-94, 1998.
DOI : 10.1007/BFb0053543

M. Beck and S. Robins, Computing the continuous discretely: Integer-point enumeration in polyhedra, 2007.
DOI : 10.1007/978-1-4939-2969-6

L. Carnevali, L. Grassi, and E. Vicario, State-Density Functions over DBM Domains in the Analysis of Non-Markovian Models, IEEE Transactions on Software Engineering, vol.35, issue.2, pp.178-194, 2009.
DOI : 10.1109/TSE.2008.101

H. Comon and Y. Jurski, Timed Automata and the Theory of Real Numbers, CON- CUR, pp.242-257, 1999.
DOI : 10.1007/3-540-48320-9_18

C. Dima, Computing reachability relations in timed automata, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science, 2002.
DOI : 10.1109/LICS.2002.1029827

R. Gómez and H. Bowman, Efficient Detection of Zeno Runs in Timed Automata, FORMATS. LNCS, pp.195-210, 2007.
DOI : 10.1007/978-3-540-75454-1_15

V. Gupta, T. A. Henzinger, and R. Jagadeesan, Robust timed automata, HART. LNCS, pp.331-345, 1997.
DOI : 10.1007/BFb0014736

T. A. Henzinger, Z. Manna, and A. Pnueli, What good are digital clocks?, ICALP. LNCS, pp.545-558, 1992.
DOI : 10.1007/3-540-55719-9_103

T. A. Henzinger and J. F. Raskin, Robust Undecidability of Timed and Hybrid Systems, HSCC. LNCS, pp.145-159, 2000.
DOI : 10.1007/3-540-46430-1_15

P. Krcál, Infinite Structures in Timed Systems, 2009.

E. Lindenstrauss and B. Weiss, Mean topological dimension, Israel Journal of Mathematics, vol.61, issue.1, pp.1-24, 2000.
DOI : 10.1007/BF02810577

O. Maler and A. Pnueli, On Recognizable Timed Languages, FoSSaCS. LNCS, pp.348-362, 2004.
DOI : 10.1007/978-3-540-24727-2_25

A. Puri, Dynamical properties of timed automata, Discrete Event Dynamic Systems, vol.10, issue.12, pp.87-113, 2000.
DOI : 10.1007/BFb0055349

I. Simon, Factorization forests of finite height, Theoretical Computer Science, vol.72, issue.1, pp.65-94, 1990.
DOI : 10.1016/0304-3975(90)90047-L

M. D. Wulf, L. Doyen, N. Markey, and J. F. Raskin, Robust safety of timed automata, Formal Methods in System Design, vol.10, issue.1???2, pp.1-3, 2008.
DOI : 10.1007/s10703-008-0056-7

URL : https://hal.archives-ouvertes.fr/hal-01194592

M. D. Wulf, L. Doyen, and J. F. Raskin, Almost ASAP semantics: from timed models to timed implementations. Formal Asp, Comput, vol.17, issue.3, pp.319-341, 2005.