I. Adler, Directed tree-width examples, Journal of Combinatorial Theory, Series B, vol.97, issue.5, pp.718-725, 2007.
DOI : 10.1016/j.jctb.2006.12.006

URL : http://doi.org/10.1016/j.jctb.2006.12.006

M. H. Albert, J. P. Grossman, R. J. Nowakowski, and D. Wolfe, An introduction to clobber, Integers, vol.5, issue.2, 2005.

S. Arnborg, D. G. Corneil, and A. Proskurowski, -Tree, SIAM Journal on Algebraic Discrete Methods, vol.8, issue.2, pp.277-284, 1987.
DOI : 10.1137/0608024

K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson, A note on reliable full-duplex transmission over half-duplex links, Communications of the ACM, vol.12, issue.5, pp.260-261, 1969.
DOI : 10.1145/362946.362970

A. Beck, M. N. Bleicher, and D. W. Crowe, Excursions into Mathematics: The Millennium Edition, 2000.

E. Beffara and S. G. Vorobyov, Adapting Gurvich-Karzanov-Khachiyan's algorithm for parity games, 2001.

D. Berwanger, A. Dawar, P. W. Hunter, S. Kreutzer, and J. Obdr?álek, The dag-width of directed graphs, Journal of Combinatorial Theory, Series B, vol.102, issue.4, pp.900-923, 2012.
DOI : 10.1016/j.jctb.2012.04.004

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

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

D. Berwanger and E. Grädel, Entanglement ??? A Measure for the Complexity of Directed Graphs with Applications to Logic and Games, Logic for Programming, pp.209-223, 2005.
DOI : 10.1007/978-3-540-32275-7_15

D. Berwanger, E. Grädel, L. Kaiser, and R. Rabinovich, Entanglement and the complexity of directed graphs, Theoretical Computer Science, vol.463, pp.2-25, 2012.
DOI : 10.1016/j.tcs.2012.07.010

H. L. Bodlaender, Treewidth: Algorithmic techniques and results, In Mathematical Foundations of Computer Science LNCS, vol.1295, pp.19-36, 1997.
DOI : 10.1007/BFb0029946

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

H. L. Bodlaender and A. M. Koster, Treewidth computations I. upper bounds. Information and Computation, pp.259-275, 2010.
DOI : 10.1016/j.ic.2009.03.008

URL : http://doi.org/10.1016/j.ic.2009.03.008

J. C. Bradfield and C. Stirling, Modal Logics and mu-Calculi: An Introduction, Handbook of Process Algebra, pp.293-330, 2000.
DOI : 10.1016/B978-044482830-9/50022-9

V. Cerf and R. E. Kahn, A Protocol for Packet Network Intercommunication, IEEE Transactions on Communications, vol.22, issue.5, pp.637-648, 1974.
DOI : 10.1109/TCOM.1974.1092259

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

K. Chatterjee, T. A. Henzinger, B. Jobstmann, and A. Radhakrishna, Gist: A Solver for Probabilistic Games, CAV 2012, pp.665-669, 2010.
DOI : 10.1007/978-3-642-14295-6_57

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

T. Chen, S. C. Ploeger, J. C. Van-de-pol, and T. A. Willemse, Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems, CONCUR'07: Concurrency Theory, pp.120-135
DOI : 10.1007/978-3-540-74407-8_9

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

R. Cleaveland, M. Klein, and B. Steffen, Faster model checking for the modal mucalculus, Computer Aided Verification, pp.410-422
DOI : 10.1007/3-540-56496-9_32

B. Courcelle and S. Olariu, Upper bounds to the clique width of graphs, Discrete Applied Mathematics, vol.101, issue.1-3, pp.77-114, 2000.
DOI : 10.1016/S0166-218X(99)00184-5

S. Cranen, J. F. Groote, J. J. Keiren, F. P. Stappers, E. P. De-vink et al., An Overview of the mCRL2 Toolset and Its Recent Advances, TACAS'13, pp.199-213, 2013.
DOI : 10.1007/978-3-642-36742-7_15

S. Cranen, J. J. Keiren, and T. A. Willemse, Stuttering Mostly Speeds Up Solving Parity Games, NASA Formal Methods, pp.207-221, 2011.
DOI : 10.1016/S0304-3975(98)00009-7

URL : http://repository.tue.nl/713699

S. Cranen, J. J. Keiren, and T. A. Willemse, A Cure for Stuttering Parity Games, Theoretical Aspects of Computing ? ICTAC 2012, pp.198-212, 2012.
DOI : 10.1007/978-3-642-32943-2_16

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

A. D. Stasio, A. Murano, V. Prignano, and L. Sorrentino, Solving Parity Games in Scala, FACS, 2014.
DOI : 10.1007/978-3-319-15317-9_9

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 and C. L. Lei, Efficient model checking in fragments of the propositional mu-calculus, Proceedings of LICS 1986, pp.267-278, 1986.

O. Friedmann, A super-polynomial lower bound for the parity game strategy improvement algorithm as we know it, 24th Annual IEEE Symposium on Logic In Computer Science, pp.145-156, 2009.

O. Friedmann, THE STEVENS-STIRLING-ALGORITHM FOR SOLVING PARITY GAMES LOCALLY REQUIRES EXPONENTIAL TIME, International Journal of Foundations of Computer Science, vol.21, issue.03, pp.277-287, 2010.
DOI : 10.1142/S0129054110007246

O. Friedmann, An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms, Logical Methods in Computer Science, vol.7, issue.3, pp.1-42, 2011.
DOI : 10.2168/LMCS-7(3:23)2011

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

O. Friedmann, Recursive algorithm for parity games requires exponential time, Theoretical Informatics and Applications, pp.449-457, 2011.
DOI : 10.1051/ita/2011124

O. Friedmann and M. Lange, Solving Parity Games in Practice, Automated Technology for Verification and Analysis 7th International Symposium, pp.182-196, 2009.
DOI : 10.1007/978-3-642-04761-9_15

O. Friedmann and M. Lange, The PGSolver collection of parity game solvers, 2010.

O. Friedmann and M. Lange, A Solver for Modal Fixpoint Logics, Electronic Notes in Theoretical Computer Science, pp.99-111, 2010.
DOI : 10.1016/j.entcs.2010.04.008

URL : http://doi.org/10.1016/j.entcs.2010.04.008

O. Friedmann, M. Latte, and M. Lange, A Decision Procedure for CTL* Based on Tableaux and Automata, Automated Reasoning, pp.331-345, 2010.
DOI : 10.1007/978-3-642-14203-1_28

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

M. Gardner, Mathematical games: Cram, crosscram and quadraphage: New games having elusive winning strategies, Scientific American, vol.230, pp.106-108, 1974.

M. W. Gazda and T. A. Willemse, Zielonka's Recursive Algorithm: dull, weak and solitaire games and tighter bounds, Proceedings GandALF 2013, pp.7-20
DOI : 10.4204/EPTCS.119.4

V. Gogate and R. Dechter, A complete anytime algorithm for treewidth, Proceedings of the 20th conference on Uncertainty in artificial intelligence, UAI '04, pp.201-208, 2004.

J. F. Groote, J. Pang, and A. G. Wouters, Analysis of a distributed system for lifting trucks, The Journal of Logic and Algebraic Programming, vol.55, issue.1-2, pp.21-56, 2003.
DOI : 10.1016/S1567-8326(02)00038-3

J. F. Groote and J. Van, A bounded retransmission protocol for large data packets, Algebraic Methodology and Software Technology, pp.536-550, 1996.
DOI : 10.1007/BFb0014338

W. H. Hesselink, Invariants for the construction of a handshake register, Information Processing Letters, vol.68, issue.4, pp.173-177, 1998.
DOI : 10.1016/S0020-0190(98)00158-6

P. W. Hunter and S. Kreutzer, Digraph measures: Kelly decompositions, games, and orderings, Theoretical Computer Science, vol.399, issue.3, pp.206-219, 2008.
DOI : 10.1016/j.tcs.2008.02.038

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

T. Johnson, N. Robertson, P. D. Seymour, and R. Thomas, Directed Tree-Width, Journal of Combinatorial Theory, Series B, vol.82, issue.1, pp.138-154, 2001.
DOI : 10.1006/jctb.2000.2031

URL : http://doi.org/10.1006/jctb.2000.2031

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

M. Jurdzi´nskijurdzi´nski, Small progress measures for solving parity games, STACS '00: Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, pp.290-301, 2000.

M. Jurdzi´nskijurdzi´nski, M. Paterson, and U. Zwick, A deterministic subexponential algorithm for solving parity games, Proceedings of the seventeenth annual ACM- SIAM symposium on Discrete algorithm -SODA '06, pp.117-123, 2006.

J. J. Keiren, Advanced Reduction Techniques for Model Checking, 2013.

J. J. Keiren, Benchmarks for parity games. CoRR, abs, 1407.
DOI : 10.1007/978-3-319-24644-4_9

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

J. J. Keiren and T. A. Willemse, Bisimulation Minimisations for Boolean Equation Systems, Proceedings of Haifa Verification Conference, pp.102-116, 2009.
DOI : 10.1007/978-3-540-77050-3_37

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

C. P. Koymans and J. C. Mulder, A modular approach to protocol verification using process algebra, Applications of Process Algebra, number 17 in Cambridge Tracts in Theoretical Computer Science, pp.261-306, 1990.
DOI : 10.1017/CBO9780511608841.012

M. Lange, Solving parity games by a reduction to SAT, Proc. of the Workshop on Games in Design and Verification, GDV'05, 2005.

K. G. Larsen, Efficient local correctness checking, Computer Aided Verification, Fourth International Workshop, CAV '92, Proceedings, pp.30-43, 1993.
DOI : 10.1007/3-540-56496-9_4

S. P. Luttik, Description and formal specification of the link layer of P1394, Workshop on Applied Formal Methods in System Design, pp.43-56, 1997.

T. Maarup, Hex -everything you always wanted to know about hex but were afraid to ask, 2005.

A. Mader, Verification of Modal Properties Using Boolean Equation Systems, 1997.

R. Mateescu, A Generic On-the-Fly Solver for Alternation-Free Boolean Equation Systems, TACAS'03, pp.81-96, 2003.
DOI : 10.1007/3-540-36577-X_7

URL : https://hal.archives-ouvertes.fr/inria-00071875

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. Nowakowski and P. Winkler, Vertex-to-vertex pursuit in a graph, Discrete Mathematics, vol.43, issue.2-3, pp.235-239, 1983.
DOI : 10.1016/0012-365X(83)90160-7

URL : http://doi.org/10.1016/0012-365x(83)90160-7

J. Obdr?álek, Fast Mu-Calculus Model Checking when Tree-Width Is Bounded, Computer Aided Verification, pp.80-92, 2003.
DOI : 10.1007/978-3-540-45069-6_7

J. Obdr?álek, Algorithmic Analysis of Parity Games, 2006.

J. Pang, W. J. Fokkink, R. Hofman, and R. Veldema, Model checking a cache coherence protocol of a Java DSM implementation, The Journal of Logic and Algebraic Programming, vol.71, issue.1, pp.1-43, 2007.
DOI : 10.1016/j.jlap.2006.08.007

R. Pelánek, Typical Structural Properties of State Spaces, Model Checking Software, pp.5-22, 2004.
DOI : 10.1007/978-3-540-24732-6_2

R. Pelánek, Web portal for benchmarking explicit model checkers, 2006.

R. Pelánek, BEEM: Benchmarks for Explicit Model Checkers, Model Checking Software, pp.263-267, 2007.
DOI : 10.1007/978-3-540-73370-6_17

A. Quilliot, Jeux et pointes fixes sur les graphes, 1978.

N. Robertson and P. D. Seymour, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, vol.7, issue.3, pp.309-322, 1986.
DOI : 10.1016/0196-6774(86)90023-4

URL : http://doi.org/10.1006/jctb.1999.1919

B. Rose, Othello., Modern Language Notes, vol.74, issue.3, 2005.
DOI : 10.2307/3040286

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

S. Schewe, Solving parity games in big steps, Journal of Computer and System Sciences, vol.84, pp.449-460, 2007.
DOI : 10.1016/j.jcss.2016.10.002

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

S. Schewe, An Optimal Strategy Improvement Algorithm for Solving Parity and Payoff Games, Computer Science Logic, pp.369-384
DOI : 10.1007/978-3-540-87531-4_27

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

. Schewe, Synthesis of Distributed Systems, 2008.

J. G. Siek, L. Q. Lee, and A. Lumsdaine, The Boost Graph Library: User Guide and Reference Manual, 2002.

M. Sighireanu and R. Mateescu, Verification of the Link layer protocol of the IEEE-1394 serial bus (FireWire): an experiment with E-LOTOS, International Journal on Software Tools for Technology Transfer (STTT), vol.2, issue.1, pp.68-88, 1998.
DOI : 10.1007/s100090050018

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

P. Stevens and C. Stirling, Practical model-checking using games, TACAS'98, pp.85-101, 1998.
DOI : 10.1007/BFb0054166

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

C. Stirling, Bisimulation, modal logic and model checking games, Logic Journal of IGPL, vol.7, issue.1, p.103124, 1999.
DOI : 10.1093/jigpal/7.1.103

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

Y. K. Tsay, Y. F. Chen, M. H. Tsai, W. C. Chan, and C. J. Luo, GOAL Extended: Towards a Research Tool for Omega Automata and Temporal Logic, TACAS'08, pp.346-350, 2008.
DOI : 10.1007/978-3-540-78800-3_26

J. C. Van-de-pol and M. Weber, A Multi-Core Solver for Parity Games, Electronic Notes in Theoretical Computer Science, vol.220, issue.2, pp.19-34, 2008.
DOI : 10.1016/j.entcs.2008.11.011

R. Veldema, R. F. Hofman, R. A. Bhoedjang, C. J. Jacobs, and H. E. Bal, Source-level global optimizations for fine-grain distributed shared memory systems, ACM SIGPLAN Notices, vol.36, issue.7, pp.83-92, 2001.
DOI : 10.1145/568014.379578

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

B. Vergauwen and J. Lewi, Efficient local correctness checking for single and alternating boolean equation systems, Automata, Languages and Programming, pp.304-315, 1994.
DOI : 10.1007/3-540-58201-0_77

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

URL : http://doi.org/10.1016/s0304-3975(98)00009-7