B. Brázdil, V. Brozek, K. Chatterjee, V. Forejt, and A. Kucera, Two views on multiple mean-payoff objectives in markov decision processes, LICS, pp.33-42, 2011.

T. Brázdil, V. Brozek, and K. Etessami, One-counter stochastic games, FSTTCS, pp.108-119, 2010.

V. Brázdil, K. Brozek, and . Etessami, Antonín Kucera, and Dominik Wojtczak . One-counter Markov decision processes, SODA, pp.863-874, 2010.

N. Baier, M. Bertrand, and . Größer, On decision problems for probabilistic büchi automata, FoSSaCS, pp.287-301, 2008.

F. Baier, M. Ciesinski, and . Größer, ProbMela and verification of Markov decision processes, ACM SIGMETRICS Performance Evaluation Review, vol.32, issue.4, pp.22-27, 2005.
DOI : 10.1145/1059816.1059821

]. A. Ber74 and . Bertoni, The solution of problems relative to probabilistic automata in the frame of the formal languages theory, Proc. of the 4th GI Jahrestagung, pp.107-112, 1974.

N. Bertrand, B. Genest, and H. Gimbert, Qualitative Determinacy and Decidability of Stochastic Games with Signals, 2009 24th Annual IEEE Symposium on Logic In Computer Science, pp.319-328, 2009.
DOI : 10.1109/LICS.2009.31

URL : https://hal.archives-ouvertes.fr/hal-00356566

J. , R. Büchi, and L. H. Landweber, Definability in the monadic second-order theory of successor, J. Symb. Log, vol.34, issue.2, pp.166-170, 1969.

A. Bertoni, G. Mauri, and M. Torelli, Some recursive unsolvable problems relating to isolated cutpoints in probabilistic automata, Proceedings of the Fourth Colloquium on Automata, Languages and Programming, pp.87-94, 1977.

P. Dimitri, S. E. Bertsekas, and . Shreve, Stochastic Optimal Control: The Discrete- Time Case, 1978.

[. Chatterjee and L. Doyen, Energy parity games, pp.599-610, 2010.
DOI : 10.1016/j.tcs.2012.07.038

URL : http://doi.org/10.1016/j.tcs.2012.07.038

[. Chatterjee and L. Doyen, Energy and Mean-Payoff Parity Markov Decision Processes, MFCS, pp.206-218, 2011.
DOI : 10.1007/978-3-642-22993-0_21

URL : http://arxiv.org/abs/1104.2909

K. Chatterjee, L. Doyen, H. Gimbert, and T. A. Henzinger, Randomness for free, MFCS, pp.246-257, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01006409

[. Chatterjee, L. Doyen, T. A. Henzinger, and J. Raskin, Generalized mean-payoff and energy games, 2010.

[. Chatterjee, Concurrent games with tail objectives, Theoretical Computer Science, vol.388, issue.1-3, pp.181-198, 2007.
DOI : 10.1016/j.tcs.2007.07.047

URL : http://doi.org/10.1016/j.tcs.2007.07.047

[. Chatterjee, T. Henzinger, and M. Jurdzinski, Mean-Payoff Parity Games, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.37-61, 2005.
DOI : 10.1109/LICS.2005.26

URL : https://hal.archives-ouvertes.fr/hal-00766251

[. Chatterjee, M. Jurdzinski, and T. A. Henzinger, Simple Stochastic Parity Games, CSL, pp.100-113, 2003.
DOI : 10.1007/978-3-540-45220-1_11

[. Chatterjee, M. Jurdzi?ski, and T. A. Henzinger, Quantitative stochastic parity games, Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, SODA '04, pp.121-130, 2004.

A. Condon and R. J. Lipton, On the complexity of space bounded interactive proofs (extended abstract), Foundations of Computer Science, pp.462-467, 1989.

T. Colcombet and C. Löding, The Non-deterministic Mostowski Hierarchy and Distance-Parity Automata, ICALP, pp.398-409, 2008.
DOI : 10.1007/978-3-540-70583-3_33

URL : https://hal.archives-ouvertes.fr/hal-00347194

E. M. Clarke, The Birth of Model Checking, 25 Years of Model Checking, pp.1-26, 2008.
DOI : 10.1007/978-3-540-69850-0_1

C. Cortes, M. Mohri, and A. Rastogi, DISTANCE AND EQUIVALENCE OF PROBABILISTIC AUTOMATA, International Journal of Foundations of Computer Science, vol.18, issue.04, pp.761-779, 2007.
DOI : 10.1142/S0129054107004966

C. Cortes, M. Mohri, A. Rastogi, and M. Riley, ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA, International Journal of Foundations of Computer Science, vol.19, issue.01, pp.219-242, 2008.
DOI : 10.1142/S0129054108005644

A. Condon, The complexity of stochastic games, Information and Computation, vol.96, issue.2, pp.203-224, 1992.
DOI : 10.1016/0890-5401(92)90048-K

[. Chadha, A. P. Sistla, and M. Viswanathan, Power of randomization in automata on infinite strings, International Conference on Concurrency Theory, pp.229-243, 2009.

M. [. Courcoubetis and . Yannakakis, Markov decision processes and regular events, ICALP'90, pp.336-349, 1990.
DOI : 10.1007/bfb0032043

C. Courcoubetis and M. Yannakakis, The complexity of probabilistic verification, Journal of the ACM, vol.42, issue.4, pp.857-907, 1995.
DOI : 10.1145/210332.210339

T. A. Luca-de-alfaro and . Henzinger, Concurrent omega-regular games, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332), pp.141-154, 2000.
DOI : 10.1109/LICS.2000.855763

[. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy (extended abstract), FOCS, pp.368-377, 1991.

H. Fijalkow, Y. Gimbert, and . Oualhadj, Pushing undecidability of the isolation problem for probabilistic automata, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00585840

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

Y. Gurevich and L. Harrington, Trees, automata, and games, Proceedings of the fourteenth annual ACM symposium on Theory of computing , STOC '82, pp.60-65, 1982.
DOI : 10.1145/800070.802177

H. Gimbert and F. Horn, Solving Simple Stochastic Tail Games, pp.27-64, 1000.
DOI : 10.1137/1.9781611973075.69

URL : https://hal.archives-ouvertes.fr/hal-00413430

D. Gillette, Stochastic games with zero stop probability. Contributions to the Theory of Games, pp.179-187, 1957.

H. Gimbert, Pure Stationary Optimal Strategies in Markov Decision Processes, STACS, pp.200-211, 2007.
DOI : 10.1007/978-3-540-70918-3_18

URL : https://hal.archives-ouvertes.fr/hal-00140144

H. Gimbert, Randomized Strategies are Useless in Markov Decision Processes, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00403463

H. Gimbert and Y. Oualhadj, Probabilistic Automata on Finite Words: Decidable and Undecidable Problems, International Colloquium on Automata, Languages and Programming, pp.527-538, 2010.
DOI : 10.1007/978-3-642-14162-1_44

URL : https://hal.archives-ouvertes.fr/hal-00456538

H. Gimbert and W. Zielonka, Deterministic Priority Mean-Payoff Games as Limits of Discounted Games, ICALP (2), pp.312-323, 2006.
DOI : 10.1007/11787006_27

URL : https://hal.archives-ouvertes.fr/hal-00160434

H. Gimbert and W. Zielonka, Limits of Multi-Discounted Markov Decision Processes, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.89-98, 2007.
DOI : 10.1109/LICS.2007.28

URL : https://hal.archives-ouvertes.fr/hal-00140148

H. Gimbert and W. Zielonka, Perfect Information Stochastic Priority Games, ICALP, pp.850-861, 2007.
DOI : 10.1007/978-3-540-73420-8_73

URL : https://hal.archives-ouvertes.fr/hal-00140150

K. [. Vardi, M. Etessami, M. Kwiatkowska, and . Yannakakis, Multi-objective model checking of markov decision processes, Proc of TACAS'07, pp.50-65, 2007.

G. [. Kwiatkowska, D. Norman, and . Parker, Stochastic Model Checking, Formal Methods for the Design of Computer, Communication and Software Systems: Performance Evaluation (SFM'07), 2007.
DOI : 10.1007/978-3-540-72522-0_6

D. Kozen, Lower bounds for natural proof systems, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.254-266, 1977.
DOI : 10.1109/SFCS.1977.16

J. [. Lemke, Equilibrium Points of Bimatrix Games, Journal of the Society for Industrial and Applied Mathematics, vol.12, issue.2, pp.413-423, 1964.
DOI : 10.1137/0112033

S. [. Liggett and . Lippman, Stochastic Games with Perfect Information and Time Average Payoff, SIAM Review, vol.11, issue.4, pp.604-607, 1969.
DOI : 10.1137/1011093

]. D. Mar75 and . Martin, Borel determinacy, Annals of Mathematics, vol.102, pp.363-371, 1975.

A. Donald and . Martin, The determinacy of blackwell games, J. Symb. Log, vol.63, issue.4, pp.1565-1581, 1998.

O. Madani, S. Hanks, and A. Condon, On the undecidability of probabilistic planning and related stochastic optimization problems, Artificial Intelligence, vol.147, issue.1-2, pp.5-34, 2003.
DOI : 10.1016/S0004-3702(02)00378-8

O. Madani, S. Hanks, and A. Condon, On the undecidability of probabilistic planning and related stochastic optimization problems, Artificial Intelligence, vol.147, issue.1-2, pp.5-34, 2003.
DOI : 10.1016/S0004-3702(02)00378-8

J. D. Morrow, Game Theory for Political Scientists, 1994.

S. Maitra, Stochstic games with borel payoffs. A Maitra, W Sudderth -Stochastic Games and Applications
DOI : 10.1007/978-94-010-0189-2_24

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.531.253

E. David, P. E. Muller, and . Schupp, The theory of ends, pushdown automata, and second-order logic, Theor. Comput. Sci, vol.37, pp.51-75, 1985.

E. David, P. E. Muller, and . Schupp, Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of rabin, mcnaughton and safra, Theor. Comput. Sci, vol.141, issue.1&2, pp.69-107, 1995.

R. B. Myerson, Game Theory: Analysis of Conflict, 1991.

J. F. Nash, Equilibrium points in n-person games, Proceedings of the National Academy of Sciences, vol.36, issue.1, pp.48-49, 1950.
DOI : 10.1073/pnas.36.1.48

J. Von-neumann and O. Morgenstern, Theory of Games and Economic Behavior, 1944.

]. J. Nor97 and . Norris, Markov chains, 1997.

J. Martin, P. S. Osborne, and . Walker, A note on " the early history of the theory of strategic games from waldegrave to borel " by robert w. dimand and mary ann dimand, History of Political Economy, vol.28, issue.1, pp.81-82, 1996.

C. H. Papadimitriou, Computational Complexity, 1993.

A. Paz, Introduction to probabilistic automata (Computer science and applied mathematics ), pp.81-83, 1971.

L. Martin and . Putterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming, pp.18-31, 1994.

J. Queille and J. Sifakis, A temporal logic to deal with fairness in transition systems, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982), pp.217-225, 1982.
DOI : 10.1109/SFCS.1982.57

O. Michael and . Rabin, Probabilistic automata, Information and Control, vol.6, issue.77, pp.230-245, 1963.

O. Michael and . Rabin, Decidability of Second Order Theories and Automata on Infinite Trees, Transactions of the American Mathematical Society, vol.141, pp.1-35, 1969.

J. Walter and . Savitch, Relationships between nondeterministic and deterministic tape complexities, J. Comput. Syst. Sci, vol.4, issue.2, pp.177-192, 1970.

]. L. Sha53 and . Shapley, Stochastic games, Proceedings of the National Academy of Sciences, vol.39, issue.10, pp.1095-1100, 1953.

I. Simon, Factorization forests of finite height, Theoretical Computer Science, vol.72, issue.1, pp.65-94, 1990.
DOI : 10.1016/0304-3975(90)90047-L

]. J. Smi82 and . Smith, Evolution and the Theory of Games, 1982.

M. Mateescu, T. A. Henzinger, and V. Wolf, Sliding-window abstraction for infinite markov chains, Proc. of CAV'09, pp.337-352, 2009.

[. Tzeng, A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata, SIAM Journal on Computing, vol.21, issue.2, pp.216-227, 1992.
DOI : 10.1137/0221017

[. Velner, The complexity of mean-payoff automaton expression. CoRR, abs/1106, 2011.

E. Zermelo, Über eine Anwendung der Mengenlehre auf die Theorie des Schachspiels, Proceedings of the Fifth International Congress Mathematics, pp.501-504, 1913.

W. Zielonka, Infinite games on finitely coloured graphs with applications to automata on infinite trees, FoSSaCS, pp.135-183, 1998.
DOI : 10.1016/S0304-3975(98)00009-7