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

C. Baier, N. Bertrand, P. Bouyer, . Th, M. Brihaye et al., Probabilistic and Topological Semantics for Timed Automata, Proceedings of FSTTCS'07, pp.179-191, 2007.
DOI : 10.1007/978-3-540-77050-3_15
URL : https://hal.archives-ouvertes.fr/inria-00424526

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

C. Baier and J. Katoen, Principles of model checking, 2008.

N. Bertrand and S. Schewe, Playing Optimally on Timed Automata with Random Delays, Proceedings of FORMATS'12, pp.43-58, 2012.
DOI : 10.1007/978-3-642-33365-1_5
URL : https://hal.archives-ouvertes.fr/hal-00752440

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

P. Bouyer and V. Forejt, Reachability in Stochastic Timed Games, Proceedings of ICALP'09, pp.103-114, 2009.
DOI : 10.1007/978-3-642-02930-1_9

T. Brázdil, J. Krcál, J. Kretínsk´kretínsk´y, A. Kucera, and V. Rehák, Stochastic Real-Time Games with Qualitative Timed Automata Objectives, Proceedings of CONCUR'10, pp.207-221, 2010.
DOI : 10.1007/978-3-642-15375-4_15

K. Chatterjee, L. De-alfaro, and T. A. Henzinger, Qualitative concurrent parity games, ACM Transactions on Computational Logic, vol.12, issue.4, p.28, 2011.
DOI : 10.1145/1970398.1970404

K. Chatterjee and M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, 2012 27th Annual IEEE Symposium on Logic in Computer Science, pp.185-194, 2012.
DOI : 10.1109/LICS.2012.29

T. Chen, T. Han, J. Katoen, and A. Mereacre, Reachability probabilities in Markovian Timed Automata, IEEE Conference on Decision and Control and European Control Conference, pp.7075-7080, 2011.
DOI : 10.1109/CDC.2011.6160992

L. De-alfaro, T. A. Henzinger, and O. Kupferman, Concurrent reachability games, Theoretical Computer Science, vol.386, issue.3, pp.188-217, 2007.
DOI : 10.1016/j.tcs.2007.07.008

N. Fijalkow, H. Gimbert, and Y. Oualhadj, Deciding the value 1 problem for probabilistic leaktight automata, Proceedings of LICS'12, pp.295-304, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01140262

H. Gimbert and Y. Oualhadj, Probabilistic Automata on Finite Words: Decidable and Undecidable Problems, Proceedings of ICALP'10, pp.527-538, 2010.
DOI : 10.1007/978-3-642-14162-1_44
URL : https://hal.archives-ouvertes.fr/hal-00456538

F. Laroussinie, N. Markey, and P. Schnoebelen, Model Checking Timed Automata with One or Two Clocks, Proceedings of CONCUR'04, pp.387-401, 2004.
DOI : 10.1007/3-540-45931-6_19
URL : https://hal.archives-ouvertes.fr/hal-01194617

N. Wolovick and S. Johr, A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes, Proceedings of FORMATS'06, pp.352-367, 2006.
DOI : 10.1007/11867340_25