K. R. Apt and E. Grädel, Lectures in Game Theory for Computer Scientists, 2011.
DOI : 10.1017/CBO9780511973468

A. Arnold and D. Niwi´nskiniwi´nski, Rudiments of µ-calculus, volume 146 of Studies in Logic and the Foundations of Mathematics, 2001.

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

D. Berwanger, K. Chatterjee, M. D. Wulf, L. Doyen, and T. A. Henzinger, Alpaga: A Tool for Solving Parity Games with Imperfect Information, Proceedings of Tools and Algorithms for the Construction and Analysis of Systems (TACAS'09), volume 5505 of Lecture Notes in Computer Science, pp.58-61, 2009.
DOI : 10.1016/S0304-3975(98)00009-7

D. Berwanger, K. Chatterjee, M. D. Wulf, L. Doyen, and T. A. Henzinger, Strategy construction for parity games with imperfect information, Information and Computation, vol.208, issue.10, pp.1206-1220, 2010.
DOI : 10.1016/j.ic.2009.09.006

A. Carayol, A. Haddad, and O. Serre, Qualitative Tree Languages, 2011 IEEE 26th Annual Symposium on Logic in Computer Science, pp.13-22, 2011.
DOI : 10.1109/LICS.2011.28
URL : https://hal.archives-ouvertes.fr/hal-00616304

A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer, Alternation, Journal of the ACM, vol.28, issue.1, pp.114-133, 1981.
DOI : 10.1145/322234.322243

K. Chatterjee, L. Doyen, T. Henzinger, and J. Raskin, Algorithms for Omega-Regular Games with Imperfect Information, Logical Methods in Computer Science, vol.3, issue.3, 2007.
DOI : 10.1007/11874683_19

R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi, Reasoning about Knowledge, 1995.

J. Flum, E. Grädel, and T. Wilke, Logic and Automata: History and Perspectives, 2007.
DOI : 10.5117/9789053565766

V. Gripon and O. Serre, Qualitative Concurrent Stochastic Games with Imperfect Information, Automata, Languages and Programming, 36th International Colloquium, pp.200-211, 2009.
DOI : 10.1007/978-3-642-02930-1_17
URL : https://hal.archives-ouvertes.fr/hal-00360857

O. Kupferman, M. Y. Vardi, and P. Wolper, An automata-theoretic approach to branching-time model checking, Journal of the ACM, vol.47, issue.2, pp.312-360, 2000.
DOI : 10.1145/333979.333987

D. E. Muller and P. E. Schupp, Simulating alternating tree automata by nondeterministic automata: New results and new proofs of the theorems of Rabin, McNaughton and Safra, Theoretical Computer Science, vol.141, issue.1-2, pp.14169-107, 1995.
DOI : 10.1016/0304-3975(94)00214-4

J. Reif, Universal games of incomplete information, Proceedings of the eleventh annual ACM symposium on Theory of computing , STOC '79, pp.288-308, 1979.
DOI : 10.1145/800135.804422

W. Thomas, Languages, Automata, and Logic, Handbook of Formal Language Theory, pp.389-455, 1997.
DOI : 10.1007/978-3-642-59126-6_7

M. D. Wulf, L. Doyen, T. A. Henzinger, and J. Raskin, Antichains: A New Algorithm for Checking Universality of Finite Automata, Proceedings of Computer Aided Verification (CAV'06), pp.17-30, 2006.
DOI : 10.1007/11817963_5

W. Zielonka, Infinite games on finitely coloured graphs with applications to automata on infinite trees, Theoretical Computer Science, vol.200, issue.1-2, pp.135-183, 1998.
DOI : 10.1016/S0304-3975(98)00009-7