M. Agrawal, S. Akshay, B. Genest, and P. S. Thiagarajan, Approximate verication of the symbolic dynamics of Markov chains, Journal of the ACM, vol.62, issue.1, 2015.

S. Akshay, T. Antonopoulos, J. Ouaknine, and J. Worrell, Reachability problems for Markov chains, Information Processing Letters, vol.115, issue.2, p.155158, 2015.

S. Akshay, B. Genest, B. Karelovi¢, and N. Vyas, On Regularity of Unary Probabilistic Automata, of Leibniz International Proceedings in Informatics (LIPIcs), pages 8:18:14. Schloss DagstuhlLeibniz-Zentrum fuer Informatik, vol.47, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01245037

A. Arnold and D. Niwi«ski, Rudiments of µ-calculus, Studies in Logic and the Foundations of Mathematics, vol.146, 2001.

A. Bertoni, The solution of problems relative to probabilistic automata in the frame of the formal languages theory, GI Jahrestagung, p.107112, 1974.

T. Bewley and E. Kohlberg, The asymptotic theory of stochastic games, Mathematics of Operations Research, vol.1, 1976.

D. Beauquier, A. Rabinovich, and A. Slissenko, A logic of probability with decidable model-checking, International Workshop on Computer Science Logic, vol.2471, p.306321, 2002.

K. Chatterjee, L. De-alfaro, and T. A. Henzinger, Strategy improvement for concurrent reachability and turn-based stochastic safety games, Journal of Computer and System Sciences, vol.79, issue.5, p.640657, 2013.

K. Chatterejee, M. Jurdzi«ski, and T. A. Henzinger, Quantitative stochastic parity games, Proceedings of the 15th Annual Symposium on Discrete Algorithms, p.114123, 2004.

. Cjk`cjk, , vol.16

C. S. Calude, S. Jain, B. Khoussainov, W. Li, and F. Stephan, Deciding parity games in quasipolynomial time, 2016.

. Ckv`ckv-;-r, V. Chadha, M. Korthikanti, G. Vishwanathan, Y. Agha et al., Model checking MDPs with a unique compact invariant set of distributions, 2011 Eighth International Conference on Quantitative Evaluation of SysTems, p.121130, 2011.

R. Chadha, D. Kini, and M. Viswanathan, Decidable problems for unary PFAs, International Conference on Quantitative Evaluation of Systems, vol.8657, p.329344, 2014.

A. Condon, The complexity of stochastic games. Information and Computation, vol.96, p.203224, 1992.

M. G. Crandall and L. Tartar, Some relations between nonexpansive and order preserving mappings, Proceedings of the American Mathematical Society, vol.78, issue.3, p.385390, 1980.

K. Chatterjee and M. Tracol, Decidable problems for probabilistic automata on innite words, Logic in Computer Science (LICS), 2012 27th Annual IEEE Symposium on, p.185194, 2012.

L. De-alfaro, Formal Verication of Probabilistic Systems, 1997.

L. De-alfaro and T. A. Henzinger, Concurrent omega-regular games, Logic in Computer Science. Proceedings. 15th Annual IEEE Symposium on, p.141154, 2000.

L. De-alfaro, T. A. Henzinger, and O. Kupferman, Concurrent reachability games, Theoretical Computer Science, vol.386, p.188217, 2007.

L. De-alfaro and R. Majumdar, Quantitative solution to omega-regular games, Journal of Computer and System Sciences, vol.68, p.374397, 2004.

E. A. Emerson and C. Jutla, Tree automata, µ-calculus and determinacy, Foundations of Computer Science. Proceedings., 32nd Annual Symposium on, p.368377, 1991.
DOI : 10.1109/sfcs.1991.185392

H. Everett, Recursive games. Contributions to the Theory of Games, vol.3, p.4778, 1957.

N. Fijalkow, H. Gimbert, and Y. Ouahlad, Deciding the value 1 problem for probabilistic leaktight automata, Logic in Computer Science (LICS), 27th Annual IEEE Symposium on, vol.11, p.295304
DOI : 10.1109/lics.2012.40
URL : https://hal.archives-ouvertes.fr/hal-01140262

, IEEE, 2012.

J. Filar and K. Vrieze,

, Competitive Markov Decision Processes

. Springer, , 1997.

Y. Gurevich and L. Harrington, Trees, automata and games, Proceedings of the fourteenth annual ACM symposium on Theory of computing, p.6065, 1982.
DOI : 10.1145/800070.802177

H. Gimbert and Y. Oualhadj, Probabilistic automata on nite words: Decidable and undecidable problems, International Colloquium on Automata, Languages, and Programming, vol.6199, p.527538
DOI : 10.1007/978-3-642-14162-1_44
URL : https://hal.archives-ouvertes.fr/hal-00456538/file/gimbert_oualhadj_probabilistic_automata.pdf

. Springer, , 2010.

E. Grädel, W. Thomas, and T. Wilke, Automata, Logics, and Innite Games, vol.2500, 2002.

V. Halava, T. Harju, and M. Hirvensalo, Positivity of second order linear recurrent sequences, Discrete Applied Mathematics, vol.154, issue.3, 2006.

A. J. Homan and R. M. Karp, On nonterminating stochastic games, Management Science, vol.12, issue.5, p.359370, 1966.

S. Zamir, J. Mertens, and S. Sorin, Repeated games, 2015.

P. R. Kumar and T. H. Shiau, Existence of value and randomized strategies in zero-sum discrete-time stochastic dynamic games, SIAM Journal on Control and Optimization, vol.19, issue.5, p.617634, 1981.

V. A. Korthikanti, M. Viswanathan, G. Agha, and Y. Kwon, Reasoning about MDPs as transformers of probability distributions, Quantitative Evaluation of Systems, Seventh International Conference on the, 2010.
DOI : 10.1109/qest.2010.35
URL : https://www.ideals.illinois.edu/bitstream/2142/16515/2/mdptransdist.pdf

B. Karelovi¢ and W. Zielonka, Nearest xed points and concurrent priority games, International Symposium on Fundamentals of Computation Theory, vol.9210, p.381393, 2015.

S. Lang, Undergraduate analysis, 2013.

Y. David-asher-levin, E. L. Peres, and . Wilmer, Markov chains and mixing times, 2009.

D. A. Martin, The determinacy of Blackwell games, Journal of Symbolic Logic, vol.63, issue.4, p.15651581, 1998.

O. Madani, S. Hanks, and A. Condon, On the undecidability of probabilistic planning and related stochastic optimization problems, Articial Intelligence, vol.147, issue.1-2, p.534, 2003.

A. K. Mciver and C. C. Morgan, Games, probability, and the quantitative µ-calculus qMµ, International Conference on Logic for Programming Articial Intelligence and Reasoning, vol.2514, p.292310

. Springer, , 2002.

A. P. Maitra and W. D. Sudderth, Discrete Gambling and Stochastic Games, 1996.

A. Maitra and W. Sudderth, Stochastic games with Borel payos, Stochastic Games and Applications, vol.570, p.367373, 2004.

]. L. Mtc`mtc`14, I. Maruthi, A. Tkachev, E. Carta, P. Cinquemani et al., Towards real-time control of gene expression at the single cell level: a stochastic control approach, International Conference on Computational Methods in Systems Biology, vol.8859, pp.155-172, 2014.

A. Neyman, Stochastic games and nonexpansive maps, Stochastic Games and Applications, vol.570, p.397415, 2003.

, Stochastic Games and Applications, vol.570, 2004.

J. Ouaknine and J. Worrell, Decision problems for linear recurrence sequences, International Workshop on Reachability Problems, vol.7550, p.2128, 2012.

J. Ouaknine and J. Worrell, On the Positivity Problem for simple linear recurrence sequences, International Colloquium on Automata, Languages, and Programming, vol.8573, p.318329, 2014.

J. Ouaknine and J. Worrell, Positivity problems for low-order linear recurrence sequences, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, p.366379, 2014.

J. Ouaknine and J. Worrell, Ultimate Positivity is decidable for simple linear recurrence sequences, International Colloquium on Automata, Languages, and Programming, vol.8573, p.330341, 2014.

A. Paz, Introduction to Probabilistic Automata, 1971.

P. Secchi, On the existence of good stationary strategies for nonleavable stochastic games, International Journal of Game Theory, vol.27, issue.1, p.6181, 1998.

L. S. Shapley, Stochastic games, Proceedings of the National Academy of Sciences, vol.39, issue.10, p.10951100, 1953.

S. Sorin, A First Course on Zero-Sum Repeated Games, vol.37

. Springer, , 2002.

A. Tarski, A lattice-theoretical xpoint theroem and its aplications, Pacic journal of Mathematics, vol.5, p.285309, 1955.

P. Turakainen, On stochastic languages, Information and Control, vol.12, issue.4, p.304313, 1968.

I. Walukiewicz, Monadic second-order logic on tree-like structures. Theoretical Computer Science, vol.275, p.311346, 2002.

W. Zielonka, Innite games on nitely coloured graphs with applications to automata on innite trees, Theoretical Computer Science, pp.135-183, 1998.