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, P. Pettersson et al., Minimum-Cost Reachability for Priced Timed Automata, BRICS Report Series, vol.8, issue.3, pp.147-161, 2001.
DOI : 10.7146/brics.v8i3.20457

P. Bouyer, U. Fahrenberg, K. G. Larsen, and N. Markey, Timed automata with observers under energy constraints, Proceedings of the 13th ACM international conference on Hybrid systems: computation and control, HSCC '10, pp.61-70, 2010.
DOI : 10.1145/1755952.1755963

P. Bouyer, U. Fahrenberg, K. G. Larsen, N. Markey, and J. Srba, Infinite Runs in Weighted Timed Automata with Energy Constraints, Proceedings of the 6th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS'08), pp.33-47, 2008.
DOI : 10.1007/978-3-540-85778-5_4
URL : https://hal.archives-ouvertes.fr/hal-01194594

T. Brázdil, P. Jan?ar, and A. Ku?era, Reachability Games on Extended Vector Addition Systems with States, Proceedings of 37th International Colloquium on Automata, Languages and Programming (ICALP'10), pp.478-489, 2010.
DOI : 10.1007/978-3-642-14162-1_40

A. Chakrabarti, L. De-alfaro, T. A. Henzinger, and M. Stoelinga, Resource Interfaces, Embedded Software, Third International Conference, EMSOFT 2003, pp.117-133, 2003.
DOI : 10.1007/978-3-540-45212-6_9

J. Chaloupka, Z-Reachability Problem for Games on 2-Dimensional Vector Addition Systems with States Is in P, Proceedings of the 4th International Workshop on Reachability Problems (RP'10). LNCS, pp.104-119, 2010.
DOI : 10.1007/978-3-642-15349-5_7

K. Chatterjee, L. Doyen, T. Henzinger, and J. F. Raskin, Generalized mean-payoff and energy games, Proceedings of FSTTCS'10. LIPIcs, pp.505-516

K. Chatterjee, L. Doyen, S. Abramsky, C. Gavoille, and C. Kirchner, Energy Parity Games, Lecture Notes in Computer Science, vol.6199, issue.2, pp.599-610, 2010.
DOI : 10.1007/978-3-642-14162-1_50
URL : http://doi.org/10.1016/j.tcs.2012.07.038

A. Degorre, L. Doyen, R. Gentilini, J. F. Raskin, and S. Torunczyk, Energy and Mean-Payoff Games with Imperfect Information
DOI : 10.1007/978-3-642-15205-4_22
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.396.8753

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

J. Esparza, Decidability and complexity of Petri net problems ? An introduction Lectures on Petri Nets I: Basic Models, LNCS, vol.1491, pp.374-428, 1998.

S. Kosaraju and G. Sullivan, Detecting cycles in dynamic graphs in polynomial time, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.398-406, 1988.
DOI : 10.1145/62212.62251

M. Minsky, Computation: Finite and Infinite Machines, 1967.

H. Yen, A unified approach for deciding the existence of certain petri net paths, Information and Computation, vol.96, issue.1, pp.119-137, 1992.
DOI : 10.1016/0890-5401(92)90059-O

U. Zwick and M. Paterson, The complexity of mean payoff games on graphs, Theoretical Computer Science, vol.158, issue.1-2, pp.343-359, 1996.
DOI : 10.1016/0304-3975(95)00188-3