R. Alur, M. Bernadsky, and P. Madhusudan, Optimal Reachability for Weighted Timed Games, Proceedings of the 31st International Colloquium on Automata, Languages and Programming, pp.122-133, 2004.
DOI : 10.1007/978-3-540-27836-8_13
URL : http://repository.upenn.edu/cgi/viewcontent.cgi?article=1201&context=cis_papers

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, Theoretical Computer Science, vol.318, issue.3, pp.297-322, 2004.
DOI : 10.1016/j.tcs.2003.10.038

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), pp.147-161, 2001.
DOI : 10.7146/brics.v8i3.20457
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.8691

T. Berendsen, D. Chen, and . Jansen, Undecidability of Cost-Bounded Reachability in Priced Probabilistic Timed Automata, Theory and Applications of Models of Computation, pp.128-137, 2009.
DOI : 10.1007/978-3-642-02017-9_16

P. Bouyer, T. Brihaye, V. Bruyère, and J. Raskin, On the optimal reachability problem of weighted timed automata. Formal Methods in System Design, 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.
DOI : 10.1016/j.ipl.2006.01.012
URL : https://hal.archives-ouvertes.fr/hal-01194609

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, pp.148-160, 2004.
DOI : 10.1007/978-3-540-30538-5_13
URL : https://hal.archives-ouvertes.fr/hal-00350483

P. Bouyer, S. Jaziri, and N. Markey, On the value problem in weighted timed games, 2014.

P. Bouyer, K. G. Larsen, N. Markey, and J. Rasmussen, Almost Optimal Strategies in One Clock Priced Timed Games, Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems (FORMATS'05), pp.345-356, 2005.
DOI : 10.1007/11944836_32

T. Brihaye, G. Geeraerts, A. Haddad, E. Lefaucheux, and B. Monmege, Simple priced timed games are not that simple, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01452621

T. Brihaye, G. Geeraerts, A. Haddad, and B. Monmege, To reach or not to reach? Efficient algorithms for total-payoff games, Proceedings of the 26th International Conference on Concurrency Theory (CONCUR'15), volume 42 of LIPIcs, pp.297-310, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01273475

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'13), pp.560-575, 2014.
DOI : 10.1007/978-3-662-44584-6_38
URL : https://hal.archives-ouvertes.fr/hal-01273480

F. M. Gale and . Stewart, 13. Infinite Games with Perfect Information, Contributions to the theory of games, pp.245-266, 1953.
DOI : 10.1515/9781400881970-014
URL : https://hal.archives-ouvertes.fr/in2p3-00013000

T. Dueholm-hansen, R. Ibsen-jensen, and P. B. Miltersen, A Faster Algorithm for Solving One-Clock Priced Timed Games, Proceedings of the 24th International Conference on Concurrency Theory (CONCUR'13), pp.531-545, 2013.
DOI : 10.1007/978-3-642-40184-8_37

J. Peter, W. M. Ramadge, and . Wonham, The control of discrete event systems, Proceedings of the IEEE, pp.81-98, 1989.

M. Rutkowski, Two-Player Reachability-Price Games on Single-Clock Timed Automata, Proceedings of the 9th Workshop on Quantitative Aspects of Programming Languages of Electronic Proceedings in Theoretical Computer Science, pp.31-46, 2011.
DOI : 10.4204/EPTCS.57.3
URL : http://doi.org/10.4204/eptcs.57.3