R. Alur, M. Bernadsky, and P. Madhusudan, Optimal Reachability for Weighted Timed Games, Proc. of ICALP'04, pp.122-133, 2004.
DOI : 10.1007/978-3-540-27836-8_13

R. Alur, S. L. Torre, and G. J. Pappas, Optimal paths in weighted timed automata, Proc. 4th Int. Workshop Hybrid Systems: Computation and Control (HSCC'01), pp.49-62, 2001.

G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, P. Pettersson et al., Minimum-Cost Reachability for Priced Timed Automata, Proc. 4th Int. Workshop on Hybrid Systems: Computation and Control (HSCC'01), pp.147-161, 2001.
DOI : 10.7146/brics.v8i3.20457

P. Bouyer, . Th, V. Brihaye, J. Bruyère, and . Raskin, On the??optimal reachability problem of weighted timed automata, Formal Methods in System Design, vol.1, issue.1???2, pp.135-175, 2007.
DOI : 10.1007/s10703-007-0035-4

P. Bouyer, . Th, N. Brihaye, and . Markey, Improved undecidability results on weighted timed automata, Proc. Letters, pp.188-194, 2006.
DOI : 10.1016/j.ipl.2006.01.012
URL : https://hal.archives-ouvertes.fr/hal-01194609

P. Bouyer, E. Brinksma, and K. G. Larsen, Staying Alive as Cheaply as Possible, Proc. 7th Int. Workshop Hybrid Systems: Computation and Control LNCS 2993, pp.203-218, 2004.
DOI : 10.1007/978-3-540-24743-2_14

P. Bouyer, F. Cassez, E. Fleury, and K. G. Larsen, Optimal strategies in priced timed game automata, Proc. of FSTTCS'04, pp.148-160, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00350483

P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and J. Srba, Infinite Runs in Weighted Timed Automata with Energy Constraints, 2008.
DOI : 10.1007/978-3-540-85778-5_4
URL : https://hal.archives-ouvertes.fr/hal-01194594

P. Bouyer, K. G. Larsen, and N. Markey, Model-checking one-clock priced timed automata, Proc. 10th Int. Conf. Foundations of Software Science and Computation Structures (FoSSaCS'07), pp.108-122, 2007.
URL : https://hal.archives-ouvertes.fr/hal-01194603

P. Bouyer, K. G. Larsen, N. Markey, and J. I. Rasmussen, Almost optimal strategies in one-clock priced timed automata, Proc. of (FSTTCS'06), pp.345-356, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01194611

P. Bouyer and N. Markey, Costs Are Expensive!, Proc. of FORMATS'07, pp.53-68, 2007.
DOI : 10.1007/978-3-540-75454-1_6
URL : https://hal.archives-ouvertes.fr/hal-01194600

. Th, V. Brihaye, J. Bruyère, and . Raskin, Model-checking for weighted timed automata, Proc. Joint Conf. Formal Modelling and Analysis of Timed Systems and Formal Techniques in Real-Time and Fault Tolerant System (FOR- MATS+FTRTFT'04), pp.277-292, 2004.

. Th, V. Brihaye, J. Bruyère, and . Raskin, On optimal timed strategies, Proc. of (FORMATS'05), pp.49-64, 2005.

A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer, Alternation, Journal of the ACM, vol.28, issue.1, pp.114-133, 1981.
DOI : 10.1145/322234.322243

A. Ehrenfeucht and J. Mycielski, Positional strategies for mean payoff games, International Journal of Game Theory, vol.59, issue.2, pp.109-113, 1979.
DOI : 10.1007/BF01768705

U. Fahrenberg and K. G. Larsen, Discount-Optimal Infinite Runs in Priced Timed Automata, Electronic Notes in Theoretical Computer Science, vol.239, 2008.
DOI : 10.1016/j.entcs.2009.05.039

M. Jurdzi´nskijurdzi´nski, Deciding the winner in parity games is in UP?co-UP. Inf, Proc. Letters, pp.119-124, 1998.

M. Jurdzi´nskijurdzi´nski, F. Laroussinie, and J. Sproston, Model checking probabilistic timed automata with one or two clocks, Proc. of TACAS'07), pp.170-184, 2007.

F. Laroussinie, N. Markey, and P. Schnoebelen, Model Checking Timed Automata with One or Two Clocks, Proc. 15th Int. Conf. Concurrency Theory (CONCUR'04), pp.387-401, 2004.
DOI : 10.1007/3-540-45931-6_19
URL : https://hal.archives-ouvertes.fr/hal-01194617

K. G. Larsen and J. I. Rasmussen, Optimal conditional scheduling for multi-priced timed automata, Proc. of FOSSACS'05, pp.234-249, 2005.

D. Martin, Borel Determinacy, The Annals of Mathematics, vol.102, issue.2, pp.363-371, 1975.
DOI : 10.2307/1971035

. H. Ch and . Papadimitriou, Computational Complexity, 1994.