R. Alur, M. Bernadsky, and P. Madhusudan, Optimal Reachability for Weighted Timed Games, Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP'04), vol.3142, pp.122-133, 2004.

R. Alur and D. L. Dill, A Theory of Timed Automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.

R. Alur, S. L. Torre, and G. J. Pappas, Optimal Paths in Weighted Timed Automata, Theoretical Computer Science, vol.318, issue.3, pp.297-322, 2004.

E. Asarin and O. Maler, As Soon as Possible: Time Optimal Control for Timed Automata, Hybrid Systems: Computation and Control, vol.1569, pp.19-30, 1999.

G. Behrmann, A. Fehnker, T. Hune, K. G. Larsen, J. Romijn et al., Minimum-cost Reachability for Priced Timed Automata, Proceedings of the 4th International Workshop on Hybrid Systems: Computation and Control (HSCC'01), vol.2034, p.16, 2001.

, Symbolic Approximation of Weighted Timed Games

P. Bouyer, T. Brihaye, V. Bruyère, and J. Raskin, On the Optimal Reachability Problem of Weighted Timed Automata. Formal Methods in System Design, vol.31, pp.135-175, 2007.

P. Bouyer, T. Brihaye, and N. Markey, Improved Undecidability Results on Weighted Timed Automata, Information Processing Letters, vol.98, issue.5, pp.188-194, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01194609

P. Bouyer, E. Brinksma, and K. G. Larsen, Optimal Infinite Scheduling for MultiPriced Timed Automata. Formal Methods in System Design, vol.32, pp.3-23, 2008.

P. Bouyer, F. Cassez, E. Fleury, and K. G. Larsen, Optimal Strategies in Priced Timed Game Automata, Proceedings of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'04), vol.3328, pp.148-160, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00350483

P. Bouyer, S. Jaziri, and N. Markey, On the Value Problem in Weighted Timed Games, Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), vol.42, pp.311-324, 2015.

R. Brenguier, F. Cassez, and J. Raskin, Energy and mean-payoff timed games, 17th International Conference on Hybrid Systems: Computation and Control (part of CPS Week), HSCC'14, pp.283-292, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00943015

T. Brihaye, V. Bruyère, and J. Raskin, On Optimal Timed Strategies, Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems (FORMATS'05), vol.3829, pp.49-64, 2005.

T. Brihaye, G. Geeraerts, A. Haddad, E. Lefaucheux, and B. Monmege, Simple Priced Timed Games Are Not That Simple, Proceedings of the 35th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'15), vol.45, pp.278-292, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01452621

T. Brihaye, G. Geeraerts, A. Haddad, and B. Monmege, Pseudopolynomial Iterative Algorithm to Solve Total-Payoff Games and Min-Cost Reachability Games, Acta Informatica, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01414114

T. Brihaye, G. Geeraerts, L. Shankara-narayanan-krishna, B. Manasa, A. Monmege et al., Adding Negative Prices to Priced Timed Games, Proceedings of the 25th International Conference on Concurrency Theory (CONCUR'14), vol.8704, pp.560-575, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01273480

D. Busatto-gaston, B. Monmege, and P. Reynier, Optimal Reachability in Divergent Weighted Timed Games, Proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'17), vol.10203, pp.162-178, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01522546

R. Thomas-dueholm-hansen, P. Ibsen-jensen, and . Bro-miltersen, A Faster Algorithm for Solving One-Clock Priced Timed Games, Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), vol.8052, pp.531-545, 2013.

M. Jurdzi?ski and A. Trivedi, Reachability-Time Games on Timed Automata, Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP'07), vol.4596, pp.838-849, 2007.

M. Rutkowski, Two-Player Reachability-Price Games on Single-Clock Timed Automata, Proceedings of the Ninth Workshop on Quantitative Aspects of Programming Languages (QAPL'11), vol.57, pp.31-46, 2011.