N. References and R. Peterson, considering finite games, and introducing the notion of hierarchical games Subsequent results on solving distributed synthesis (such as [150], [112]) essentially used the same ideas and techniques, except in the fact that they consider infinite plays and/or branching time specifications. The relationships between distributed games (presented here), other (and more general) versions of distributed games[66, 67], multi-player games with partial information [147, 148], distributed synthesis, 154] and other true concurrent model based approaches such as MSCs, p.69

. Applicability, What concrete software -or hardware -problems are encodable and/or solvable in distributed games ?

G. D. Agostino and M. Hollenberg, Logical questions concerning the ??-calculus: Interpolation, Lyndon and ??o??-Tarski, The Journal of Symbolic Logic, vol.16, issue.01, pp.310-332, 2000.
DOI : 10.1016/0890-5401(89)90031-X

M. Ajtai and R. Fagin, Abstract, The Journal of Symbolic Logic, vol.49, issue.01, pp.113-150, 1990.
DOI : 10.1016/S0022-0000(70)80006-X

M. Ajtai, R. Fagin, and L. Stockmeyer, The Closure of Monadic NP, Journal of Computer and System Sciences, vol.60, issue.3, pp.660-716, 2000.
DOI : 10.1006/jcss.1999.1691

R. Alur, T. A. Henzinger, O. Kupferman, and M. Y. Vardi, Alternating refinement relations, Proc. 9th Conferance on Concurrency Theory, 1998.
DOI : 10.1007/BFb0055622

H. R. Andersen, Model checking and boolean graphs, Theoretical Computer Science, vol.126, issue.1, pp.3-30, 1994.
DOI : 10.1016/0304-3975(94)90266-6

]. A. Arnold, S??mantique des processus communicants, RAIRO. Informatique th??orique, vol.15, issue.2, pp.103-139, 1981.
DOI : 10.1051/ita/1981150201031

URL : http://archive.numdam.org/article/ITA_1981__15_2_103_0.pdf

A. Arnold, Systèmes de transitions finis et sémantique des processus communicants. TSI, pp.193-216, 1989.
DOI : 10.1051/ita/1981150201031

URL : http://archive.numdam.org/article/ITA_1981__15_2_103_0.pdf

A. Arnold, Finite Transition Systems, 1994.

A. Arnold, An initial semantics for the ??-calculus on trees and Rabin's complementation lemma, Theoretical Computer Science, vol.148, issue.1, pp.121-132, 1995.
DOI : 10.1016/0304-3975(95)00069-9

A. Arnold, The mu-calculus alternation-depth hierarchy over the binary tree is strict, Theoretical Informatics and Applications, pp.329-339, 1999.

A. Arnold and A. Dicky, An algebraic characterization of transition system equivalences, Information and Computation, vol.82, issue.2, pp.198-229, 1989.
DOI : 10.1016/0890-5401(89)90054-0

A. Arnold, G. Lenzi, and J. Marcinkowski, The hierarchy inside closed monadic ??/sub 1/ collapses on the infinite binary tree, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp.157-166, 2001.
DOI : 10.1109/LICS.2001.932492

A. Arnold and D. Niwi?ski, Fixed point characterization of Büchi automata on infinite trees, J. Inf. Process. Cybern. EIK, vol.26, pp.451-459, 1990.

A. Arnold and D. Niwi?ski, Fixed points characterization of weak monadic logic definable sets of trees, Tree, Aut. and Languages, pp.159-188, 1992.

A. Arnold and D. Niwi?ski, Rudiments of mu-calculus, volume 146 of Studies in Logic and the Foundations of Mathematics, 2001.

A. Arnold, A. Vincent, and I. Walukiewicz, Games for synthesis of controllers with partial observation, Theoretical Computer Science, vol.303, issue.1, pp.7-34, 2003.
DOI : 10.1016/S0304-3975(02)00442-5

B. Banieqbal and H. Barringer, Temporal logic with fixed points, Temporal Logic in Specification, pp.62-74, 1989.
DOI : 10.1007/3-540-51803-7_22

J. Van-benthem, Languages in Action. Catégories, Lambdas and Dynamic Logic, Studies in Logic, vol.130, 1991.

J. F. Van-benthem, Modal Correspondance Theory, 1976.

R. Berger, The undecidability of the dominoe problem. Memoirs of the, pp.1-72, 1966.

A. Bergeron, A unified approach to control problems in discrete event processes. RAIRO-ITA, pp.555-573, 1993.

J. A. Bergstra and J. W. Klop, Process theory based on bisimulation semantics, Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, 1988.
DOI : 10.1007/BFb0013021

J. Bernet, Jeux discrets pour la spécification et la synthèse de processus communiquants

J. Bernet and D. Janin, Automata theory for discrete distributed games, Foundation of Computing Theory, pp.540-551, 2005.
DOI : 10.1007/11537311_47

URL : https://hal.archives-ouvertes.fr/hal-00306410/document

J. Bernet, D. Janin, and I. Walukiewicz, Permissive strategies: from parity games to safety games, Theoretical Informatics and Applications (RAIRO), pp.261-275, 2002.
DOI : 10.1051/ita:2002013

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

O. Bernholtz and O. Grumberg, Branching time temporal logic and amorphous tree automata, Conf. on Concurrency Theory (CONCUR), pp.262-277, 1993.
DOI : 10.1007/3-540-57208-2_19

D. Berwanger and E. Grädel, Games and Model Checking for Guarded Logics, Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR 2001, pp.70-84, 2001.
DOI : 10.1007/3-540-45653-8_5

D. Berwanger and E. Grädel, Fixed-Point Logics and Solitaire Games, Theory of Computing Systems, vol.37, issue.6, pp.675-694, 2004.
DOI : 10.1007/s00224-004-1147-5

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

D. Berwanger, Games and Logical Expressiveness, 2005.

A. Blass, A game semantics for linear logic, Annals of Pure and Applied Logic, vol.56, issue.1-3, pp.183-220, 1992.
DOI : 10.1016/0168-0072(92)90073-9

J. Bradfield, The alternation hierarchy for Kozen's mu-calculus is strict, Conf. on Concurrency Theory (CONCUR), 1996.

J. Bradfield and J. R. Büchi, The modal mu-calculus alternation hierarchy is strict Weak second-order arithmetic and finite automata, Theoretical Comp. Science Z. Math. Logik und Grundl. Math, vol.195, issue.6, pp.133-15366, 1960.

J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, International Congress on Logic, pp.1-11, 1962.
DOI : 10.1007/978-1-4613-8928-6_23

J. R. Büchi, State-Strategies for Games in F ???? ??? G ????, Journal of Symbolic Logic, vol.48, pp.1171-1198, 1983.
DOI : 10.1007/978-1-4613-8928-6_33

J. R. Büchi and L. H. Landweber, Definability in the Monadic Second-Order Theory of Successor, Journal of Symbolic Logic, vol.34, issue.2, pp.166-170, 1969.
DOI : 10.1007/978-1-4613-8928-6_26

J. R. Büchi and L. H. Landweber, Solving sequential conditions by finite-state strategies, Transactions of the American Mathematical Society, vol.138, pp.295-311, 1969.
DOI : 10.1090/S0002-9947-1969-0280205-0

C. G. Cassandras and S. Lafortune, Introduction to Discrete Event Systems, 1999.

I. Castellani, Bisimulations and abstraction homomorphisms, Journal of Computer and System Sciences, vol.34, issue.2-3, pp.210-235, 1987.
DOI : 10.1016/0022-0000(87)90025-0

C. C. Chang and H. J. Keisler, Model Theory, Studies in Logic and the Foundations of Mathematics, 1990.

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
DOI : 10.1016/0890-5401(90)90043-H

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

B. Courcelle, Monadic second-order definable graph transductions: a survey, Theoretical Computer Science, vol.126, issue.1, pp.53-75, 1994.
DOI : 10.1016/0304-3975(94)90268-2

B. Courcelle, The monadic second order logic of graphs VI: on several representations of graphs by relational structures, Discrete Applied Mathematics, vol.54, issue.2-3, pp.117-149, 1994.
DOI : 10.1016/0166-218X(94)90019-1

B. Courcelle, The monadic second-order logic of graphs IX: Machines and their behaviours, Theoretical Computer Science, vol.151, issue.1, 1995.
DOI : 10.1016/0304-3975(95)00049-3

B. Courcelle, The monadic second-order logic of graphs XIV: uniformly sparse graphs and edge set quantifications, Theoretical Computer Science, vol.299, issue.1-3, 1995.
DOI : 10.1016/S0304-3975(02)00578-9

B. Courcelle and I. Walukiewicz, Monadic second-order logic, graph coverings and unfoldings of transition systems, Annals of Pure and Applied Logic, vol.92, issue.1, pp.35-62, 1998.
DOI : 10.1016/S0168-0072(97)00048-1

D. Seibert, A. Giammarresi, W. Restivo, and . Thomas, Monadic second-order logic over rectangular pictures and recognizability by tiling systems, Information and Computation, vol.125, issue.1, pp.32-45, 1996.

M. Dam, CTL * and ECTL * as a fragments of the modal µ-calculus, CAAP'92, pp.145-165, 1992.

A. Dawar and D. Janin, On the Bisimulation Invariant Fragment of Monadic ??1 in the Finite, In Found. of Soft. tech and Theor. Comp. Science LNCS LNCS, vol.3328, pp.224-237, 2004.
DOI : 10.1007/978-3-540-30538-5_19

M. De-rougemont, Second-order and Inductive Definability on Finite Structures, Zeitschrift fuer Mathematische Logik und Grundlagen der Mathematik, pp.47-63, 1987.
DOI : 10.1002/malq.19870330107

E. W. Dijkstra, A Discipline Of programming. Automatic Computation, 1976.

S. Dziembowski, M. Jurdzi?ski, and I. Walukiewicz, How much memory is needed to win infinite games?, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, 1997.
DOI : 10.1109/LICS.1997.614939

C. Jutla, E. A. Emerson, and A. Sistla, On model-checking for fragments of µcalculus, Computer Aided Verification (CAV), pp.385-396, 1993.

H. Ebbinghaus and J. Flum, Finite Model Theory, 1995.

E. Emerson, Temporal and Modal Logic, Handbook of Theor, pp.995-1072, 1990.
DOI : 10.1016/B978-0-444-88074-1.50021-4

E. A. Emerson and E. M. Clark, Characterizing correctness properties of parallel programs using fixpoints, In Int. Call. on Aut. and Lang. and Programming LNCS, vol.95, pp.169-181, 1980.
DOI : 10.1007/3-540-10003-2_69

E. A. Emerson and C. S. Jutla, The complexity of tree automata and logics of programs, IEEE Symp. on Foundations of Computer Science (FOCS), pp.328-337, 1988.

E. A. Emerson and C. S. Jutla, Tree automata, mu-calculus and determinacy, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science, pp.368-377, 1991.
DOI : 10.1109/SFCS.1991.185392

E. A. Emerson, Automated temporal reasonning about reactive systems, Logics for Concurrency : Structure versus automata, pp.111-120, 1996.

R. Fagin, Monadic generalized spectra, Zeitschrift fuer Mathematische Logik und Grundlagen der Mathematik, pp.89-96, 1975.
DOI : 10.1002/malq.19750210112

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

B. Finkbeiner and S. Schewe, Uniform Distributed Synthesis, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05), pp.321-330, 2005.
DOI : 10.1109/LICS.2005.53

A. Gabbay, A. Pnueli, S. Shelah, and J. Stavi, On the temporal analysis of fairness, Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '80, pp.163-173, 1980.
DOI : 10.1145/567446.567462

H. Gaifman, On local and nonlocal properties, Logic Colloquium '81, pp.105-135, 1982.

D. Gale and F. M. Stewart, 13. Infinite Games with Perfect Information, Ann. Math. Studies, vol.28, pp.245-266, 1953.
DOI : 10.1515/9781400881970-014

URL : https://hal.archives-ouvertes.fr/in2p3-00013000

P. Gastin, B. Lerman, and M. Zeitoun, Distributed Games with Causal Memory Are Decidable for Series-Parallel Systems, Proceedings of FSTTCS'04, 2004.
DOI : 10.1007/978-3-540-30538-5_23

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

P. Gastin, B. Lerman, and M. Zeitoun, Distributed Games and Distributed Control for Asynchronous Systems, Proceedings of LATIN'04, pp.455-465, 2004.
DOI : 10.1007/978-3-540-24698-5_49

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

B. Genest, M. Minea, A. Muscholl, D. Peled, B. Genest et al., Specifying and verifying partial order properties using template MSCs Infinite-state High level MSCs: realizability and model-checking, Proceedings of FoSSaCS'04 Proc. of the 29th International Colloquium on Automata, Languages and Programming, ICALP'02, volume 2380 of Lect. Notes Comp. Sci, pp.195-210, 2002.

R. J. Van-glabbeek, The linear time ? branching time spectrum (extended abstract)

R. J. Van-glabbeek, The linear time ? branching time spectrum II; the semantics of sequential systems with silent moves (extended abstract), Conf. on Concurrency Theory (CONCUR), pp.66-81, 1993.

E. Grädel, C. Hirsch, and M. Otto, Back and Forth Between Guarded and Modal Logics, Proceedings of 15th IEEE Symposium on Logic in Computer Science LICS 2000, pp.217-228, 2000.

E. Grädel and I. Walukiewicz, Guarded fixed point logic, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.45-54, 1999.
DOI : 10.1109/LICS.1999.782585

I. Guessarian and W. Niar-dinedane, An automaton characterization of fairness in SCCS, Symp. on Theor, pp.356-372, 1988.
DOI : 10.1007/BFb0035859

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

T. Hafer and W. Thomas, Computationnal tree logic CTL * and path quantifiers in the monadic theory of the binary tree, In Int. Call. on Aut. and Lang. and Programming LNCS, vol.267, pp.269-279, 1987.

M. Hennessy, Algebraic Theory of Processes, 1988.

M. Hennessy and R. Milner, On observing nondeterminism and concurrency, 7th Int, pp.299-309, 1980.
DOI : 10.1007/3-540-10003-2_79

M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, Journal of the ACM, vol.32, issue.1, pp.137-161, 1985.
DOI : 10.1145/2455.2460

C. Hirsch, Guarded Logics: Algorithms and Bisimulation, 2002.

C. A. Hoare, Communicating sequential processes, Communications of the ACM, vol.21, issue.8, pp.666-677, 1978.
DOI : 10.1145/359576.359585

C. A. Hoare, Communicating Sequential Processes, 1985.

M. Hollenberg, Logic and Bisimulation, 1998.

G. J. Holzmann, Design and Validation of Computer Protocols, 1991.

D. Janin, Some results about logical descriptions of non deterministic behaviours, In XIII th Found. of Soft. Tech. and Theo. Comp. Sci. LNCS, vol.761, 1993.
DOI : 10.1007/3-540-57529-4_67

D. Janin, Propriétés logiques du non déterminisme et mu-calcul modal, 1996.

D. Janin, Automata, tableaus and a reduction theorem for fixpoint calculi in arbitrary complete lattices, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.172-182, 1997.
DOI : 10.1109/LICS.1997.614945

D. Janin, When the satisfiability problem for fixpoint expressions in complete ordered sets is simple, CSL'97, 1997.

D. Janin, On the complexity of distributed synthesis, submited, 2005.

D. Janin, Contribution aux fondements des méthodes formelles: jeux, logique et automates, Thèse d'habilitation soumise à Université de, 2005.

D. Janin and G. Lenzi, On the Structure of the Monadic Logic of the Binary Tree, Mathematical Found. of Comp. Science (MFCS), pp.310-320, 1999.
DOI : 10.1007/3-540-48340-3_28

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

D. Janin and G. Lenzi, Relating levels of the mu-calculus hierarchy and levels of the monadic hierarchy, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp.347-356, 2001.
DOI : 10.1109/LICS.2001.932510

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

D. Janin and G. Lenzi, On the logical definability of topologically closed recognizable languages of infinite trees, Computing and Informatics, vol.21, pp.185-203, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00659986

D. Janin and G. Lenzi, On the relationship between weak monadic second order logic on arbitrary trees, with application to the mu-calculus, Fundam. Inform, vol.61, pp.3-4247, 2004.

D. Janin and J. Marcinkowski, A Toolkit for First Order Extensions of Monadic Games, In Symp. on Theor. Aspects of Computer Science LNCS, 2001.
DOI : 10.1007/3-540-44693-1_31

D. Janin and I. Walukiewicz, Automata for the modal mu-calculus and related results Janin and I. Walukiewicz. On the expressive completeness of the modal mucalculus with respect to monadic second order logic, Mathematical Found. of Comp. Science (MFCS) Conf. on Concurrency Theory (CONCUR), volume 1119 of LNCS, pp.263-277, 1995.

A. Joyal, M. Nielsen, and G. Winskel, Bisimulation from Open Maps, BRICS Report Series, vol.1, issue.7, 1994.
DOI : 10.7146/brics.v1i7.21663

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

M. Jurdzi?ski, Deciding the winner in parity games is in UP ??? co-UP, Information Processing Letters, vol.68, issue.3, 1998.
DOI : 10.1016/S0020-0190(98)00150-1

M. Jurdzi?ski, Small Progress Measures for Solving Parity Games, Symp. on Theor. Aspects of Computer Science (STACS) LNCS, vol.1770, pp.290-301, 2000.
DOI : 10.1007/3-540-46541-3_24

H. Kamp, Tense Logic and the Theory of Linear Order, 1968.

D. Kozen, Results on the Propositional ??-Calculus, DAIMI Report Series, vol.11, issue.146, pp.333-354, 1983.
DOI : 10.7146/dpb.v11i146.7420

O. Kupferman and M. Y. Vardi, Synthesizing distributed systems, IEEE Symp. on Logic in Computer Science (LICS), pp.389-398, 2001.

G. Lenzi, A hierarchy theorem for the mu-calculus, In Int. Call. on Aut. and Lang. and Programming LNCS, vol.1099, pp.87-97, 1996.

G. Lenzi, The Mu-calculus and the Hierarchy Problem, 1997.

G. Lenzi, A new logical characterization of Büchi automata, In Symp. on Theor. Aspects of Computer Science LNCS, 2001.

F. Lin and M. Wonham, Decentralized control and coordination of discrete-event systems with partial observation, IEEE Transactions on Automatic Control, vol.35, issue.12, pp.1330-1337, 1990.
DOI : 10.1109/9.61009

F. Lin and M. Wonham, Decentralized control and coordination of discrete-event systems with partial observation, IEEE Transactions on Automatic Control, vol.35, issue.12, pp.1330-1337, 1990.
DOI : 10.1109/9.61009

D. E. Long, A. Browne, E. C. Clarke, S. Jha, and W. R. Marrero, An improved algorithm for the evalutation of fixpoint expressions, Computer Aided Verification (CAV), pp.338-350, 1994.

P. Madhusudan, Control and Synthesis of Open Reactive Systems, 2001.

P. Madhusudan and P. Thiagarajan, Distributed control and synthesis for local specifications, volume 2076 of LNCS, 2001.
DOI : 10.1007/3-540-48224-5_33

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

P. Madhusudan and P. S. Thiagarajan, A decidable class of asynchrnous distributed controlers, CONCUR'02, pp.145-160, 2002.

J. A. Makowski and E. Ravve, Incremental model checking for decomposable strutures, Mathematical Found. of Comp. Science (MFCS), pp.540-551, 1995.

D. Martin, Borel Determinacy, The Annals of Mathematics, vol.102, issue.2, pp.363-371, 1975.
DOI : 10.2307/1971035

O. Matz, Dot-Depth and Monadic Quantifier Alternation over Pictures, 1999.

O. Matz and W. Thomas, The monadic quantifier alternation hierarchy over finite graphs is infinite, IEEE Symp. on Logic in Computer Science (LICS), pp.236-244, 1997.
DOI : 10.1109/lics.1997.614951

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

R. Mcnaughton, Infinite games played on finite graphs, Annals of Pure and Applied Logic, vol.65, issue.2, pp.149-184, 1993.
DOI : 10.1016/0168-0072(93)90036-D

R. Milner, Communication and concurrency, 1989.

S. Mohalik and I. Walukiewicz, Distributed games. In Found. of Soft. tech and Theor, Comp. Science LNCS, vol.2914, pp.338-351, 2003.
DOI : 10.1007/978-3-540-24597-1_29

F. Moller and A. Rabinovich, On the expressive power of CTL, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), pp.360-369, 1999.
DOI : 10.1109/LICS.1999.782631

A. W. Mostowski, Regular expressions for infinite trees and a standard form of automata, Fifth Symposium on Computation Theory, number 208 in LNCS, pp.157-168, 1984.
DOI : 10.1007/3-540-16066-3_15

A. W. Mostowski, Games with forbidden positions, 1991.

A. W. Mostowski, Hierarchies of weak automata and weak monadic formulas, Theoretical Computer Science, vol.83, issue.2, pp.323-335, 1991.
DOI : 10.1016/0304-3975(91)90283-8

A. A. Muchnik, Games on infinite trees and automata with dead-ends: a new proof for the decidability of the monadic second order theory of two successors, Bull. EATCS, vol.42, pp.220-267, 1992.

D. Muller, Infinite sequences and finite machines, Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design (swct 1963), pp.3-16, 1963.
DOI : 10.1109/SWCT.1963.8

D. E. Muller, A. Saoudi, and P. E. Schupp, Alternating automata, the weak monadic theory of trees and its complexity, Theoretical Computer Science, vol.97, issue.2, pp.233-244, 1992.
DOI : 10.1016/0304-3975(92)90076-R

D. E. Muller and P. E. Schupp, Alternating automata on infinite trees, Theoretical Computer Science, vol.54, issue.2-3, pp.267-276, 1987.
DOI : 10.1016/0304-3975(87)90133-2

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.67-107, 1995.
DOI : 10.1016/0304-3975(94)00214-4

D. Niwi?ski, On fixed-point clones, 13th ICALP, pp.464-473, 1986.
DOI : 10.1007/3-540-16761-7_96

D. Niwi?ski, Fixed points vs. infinite generation, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science, pp.402-409, 1988.
DOI : 10.1109/LICS.1988.5137

]. D. Niwi?ski, Fixed point characterization of infinite behavior of finite-state systems, Theoretical Computer Science, vol.189, issue.1-2, pp.1-69, 1997.
DOI : 10.1016/S0304-3975(97)00039-X

D. Niwi?ski and I. Walukiewicz, Games for the ??-calculus, Theoretical Computer Science, vol.163, issue.1-2, pp.99-116, 1997.
DOI : 10.1016/0304-3975(95)00136-0

T. Heyman, O. Grumberg, and A. Schuster, Distributed symbolic model checking for mu-calculus, Computer Aided Verification (CAV), volume 2102 of LNCS, 2001.

M. Otto, Bisimulation-invariant PTIME and higher-dimensional ??-calculus, Theoretical Computer Science, vol.224, issue.1-2, pp.237-265, 1999.
DOI : 10.1016/S0304-3975(98)00314-4

M. Otto, Modal and guarded characterisation theorems over finite transition systems, Proc. of the 17th IEEE Symp. on Logic in Computer Science (LICS), pp.371-380, 2002.

D. Park, Concurrency and automata on infinite sequences, 5th GI Conf. on Theoret. Comput. Sci, pp.167-183, 1981.
DOI : 10.1007/BFb0017309

D. Perrin and J. E. Pin, Semigroups and Automata on Infinite Words, Semigroups, Formal Languages and Groups, NATO Advanced Study Institute, pp.49-72, 1995.
DOI : 10.1007/978-94-011-0149-3_3

G. L. Peterson and J. H. Reif, Multiple-person alternation, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.348-363, 1979.
DOI : 10.1109/SFCS.1979.25

G. L. Peterson, J. H. Reif, and S. Azhar, Decision algorithms for multiplayer noncooperative games of incomplete information, Computers & Mathematics with Applications, vol.43, issue.1-2, pp.179-206, 2002.
DOI : 10.1016/S0898-1221(01)00282-6

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

A. Pnueli and R. Rosner, Distributed reactive systems are hard to synthesize, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, pp.746-757, 1990.
DOI : 10.1109/FSCS.1990.89597

V. Pratt, A decidable µ-calculus, 22 nd Symp. on Foundations of Comput. Sci, pp.421-427, 1981.

M. O. Rabin, Decidability of second order theories and automata on infinite trees, Trans. Amer. Math. Soc, vol.141, pp.1-35, 1969.

M. O. Rabin, Weakly Definable Relations and Special Automata, Mathematical Logic and Foundation of Set Theory, pp.1-23, 1970.
DOI : 10.1016/S0049-237X(08)71929-3

P. Ramadge and W. Wonham, The control of discrete event systems, Proceedings of the IEEE, vol.77, issue.1, pp.81-98, 1989.
DOI : 10.1109/5.21072

E. Rosen, Modal logic over finite structures, Journal of Logic, Language and Information, vol.6, issue.4, pp.427-439, 1997.
DOI : 10.1023/A:1008275906015

K. Rudie and W. M. Wonham, Think globally, act locally: decentralized supervisory control, IEEE Transactions on Automatic Control, vol.37, issue.11, pp.1692-1708, 1992.
DOI : 10.1109/9.173140

S. Safra, On the complexity of omega -automata, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.
DOI : 10.1109/SFCS.1988.21948

S. Safra, Exponential determinization of ?-automtata with strong fairness acceptance conditions, Proc. 24th ACM Symp. on Theory of Computer Science, 1992.

L. Santocanale, The Alternation Hierarchy for the Theory of mu-lattices, BRICS Report Series, vol.7, issue.29, pp.166-197, 2002.
DOI : 10.7146/brics.v7i29.20163

T. Schwentick, Graph Connectivity, Monadic NP and built-in relations of moderate degree, In Int. Call. on Aut. and Lang. and Programming LNCS, vol.944, pp.405-416, 1995.
DOI : 10.1007/3-540-60084-1_92

T. Schwentick and K. Barthelmann, Local normal forms for first-order logic with applications to games and automata, Discrete Mathematics and Theoretical Computer Science, vol.3, pp.109-124, 1999.
DOI : 10.1007/BFb0028580

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

H. Seidl, Fast and simple nested fixpoints, Information Processing Letters, vol.59, issue.6, pp.303-308, 1996.
DOI : 10.1016/0020-0190(96)00130-5

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

S. Shelah, The Monadic Theory of Order, The Annals of Mathematics, vol.102, issue.3, pp.379-419, 1975.
DOI : 10.2307/1971037

J. R. Shoenfield, Mathematical Logic, 1967.

J. Skurczy?ski, A characterization of B??chi tree automata, Information Processing Letters, vol.81, issue.1, pp.29-33, 2002.
DOI : 10.1016/S0020-0190(01)00190-9

C. S. Stirling, Modal and temporal logics, Handbook of Logic in Comuter Science, pp.477-563, 1991.

R. S. Streett and E. A. Emerson, An automata theoretic decision procedure for the propositional mu-calculus. Information and Computation, pp.249-264, 1989.

J. Stupp, The lattice-model is recursive in the original model, 1975.

M. Takahashi, The greatest fixed-points and rational omega-tree languages, Theoretical Computer Science, vol.44, pp.259-274, 1986.
DOI : 10.1016/0304-3975(86)90123-4

A. Tarski, A lattice-theoretical fixpoint theorem and its applications, Pacific Journal of Mathematics, vol.5, issue.2, pp.285-309, 1955.
DOI : 10.2140/pjm.1955.5.285

W. Thomas, Automata on Infinite Objects, Handbook of Theor, pp.133-191, 1990.
DOI : 10.1016/B978-0-444-88074-1.50009-3

W. Thomas, On the synthesis of strategies in infinite games, number 944 in LNCS, 1995.
DOI : 10.1007/3-540-59042-0_57

W. Thomas, Automata theory on trees and partial orders, TAPSOFT'97, number 1214 in LNCS, pp.20-38, 1997.
DOI : 10.1007/BFb0030586

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

B. A. Trakhtenbrot, Finite automata and the logic of monadic predicates, Dokl. Akad. Nauk SSSR, vol.140, pp.326-329, 1961.

B. A. Trakhtenbrot, Finite automata and the logic of one-place predicates English translation in AMS Transl, Siberian Mathematical Journal, vol.3, issue.59, pp.103-131, 1962.

M. Y. Vardi and P. Wolper, Automata-theoretic techniques for modal logics of programs, 178] A. Vincent. Synthèse de contrôleurs et stratégies gagnantes dans les jeux de parité Hermès, editor, Modélisation des Systèmes Réactifs, pp.183-221, 1986.
DOI : 10.1016/0022-0000(86)90026-7

J. Vöge and M. Jurdzi?ski, A discrete strategy improvement algorithm for solving parity games, CAV'00, 2000.

I. Walukiewicz, Completeness of Kozen's axiomatization of the propositional µcalculus, IEEE Symp. on Logic in Computer Science (LICS), 1995.

I. Walukiewicz, Monadic second order logic on tree-like structures, In Symp. on Theor. Aspects of Computer Science (STACS) LNCS, vol.1046, pp.401-414, 1996.

I. Walukiewicz, Monadic second-order logic on tree-like structures, Theoretical Computer Science, vol.275, issue.1-2, pp.311-346, 2002.
DOI : 10.1016/S0304-3975(01)00185-2

T. Wilke, Alternating tree automata, parity games, and modal µ-calculus, Journées Montoises d'Informatique Théorique, 2000.

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

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