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

R. Alur, S. L. Torre, and G. J. Pappas, Optimal Paths in Weighted Timed Automata, Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control, pp.49-62, 2001.
DOI : 10.1007/3-540-45351-2_8

C. Baier, N. Bertrand, P. Bouyer, . Th, M. Brihaye et al., Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.217-226, 2008.
DOI : 10.1109/LICS.2008.25
URL : https://hal.archives-ouvertes.fr/inria-00424520

N. Basset and E. Asarin, Thin and Thick Timed Regular Languages, Proceedings of the 9th International Colloquium on Formal Modeling and Analysis of Timed Systems (FORMATS'11), pp.113-128, 2011.
DOI : 10.1007/s00165-005-0067-8
URL : https://hal.archives-ouvertes.fr/hal-00793583

G. Behrmann, A. Fehnker, . Th, K. G. Hune, P. Larsen et al., Minimum-Cost Reachability for Priced Timed Automata, Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control (HSCC'01), volume 2034 of Lecture Notes in Computer Science, pp.147-161, 2001.
DOI : 10.7146/brics.v8i3.20457

N. Bertrand, P. Bouyer, T. Brihaye, and A. Stainer, Emptiness and Universality Problems in Timed Automata with Positive Frequency, Proceedings of the 38th International Colloquium on Automata, Languages and Programming, pp.246-257, 2011.
DOI : 10.1007/978-3-540-28644-8_25
URL : https://hal.archives-ouvertes.fr/inria-00629172

P. Bouyer, E. Brinksma, and K. G. Larsen, Optimal infinite scheduling for multipriced timed automata. Formal Methods in System Design, pp.3-23, 2008.

F. Cassez, T. A. Henzinger, and J. Raskin, A Comparison of Control Problems for Timed and Hybrid Systems, Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control (HSCC'02), volume 2289 of Lecture Notes in Computer Science, pp.134-148, 2002.
DOI : 10.1007/3-540-45873-5_13

M. Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston, Automatic verification of real-time systems with discrete probability distributions, Theoretical Computer Science, vol.282, issue.1, pp.101-150, 2002.
DOI : 10.1016/S0304-3975(01)00046-9

F. Laroussinie, N. Markey, and P. Schnoebelen, Model Checking Timed Automata with One or Two Clocks, Proceedings of the 15th International Conference on Concurrency Theory, pp.387-401, 2004.
DOI : 10.1007/3-540-45931-6_19
URL : https://hal.archives-ouvertes.fr/hal-01194617

J. Ouaknine and J. Worrell, On the language inclusion problem for timed automata: closing a decidability gap, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.54-63, 2004.
DOI : 10.1109/LICS.2004.1319600

A. Puri, Dynamical properties of timed automata. Discrete Event Dynamic Systems, pp.87-113, 2000.

A. Stainer, Frequencies in Forgetful Timed Automata, Research Report, vol.8009, 2012.
DOI : 10.1007/978-3-642-33365-1_17
URL : https://hal.archives-ouvertes.fr/hal-00744081