G. Aucher and &. Bolander, Available at http://www.aaai.org/ocs/index, Undecidability in Epistemic Planning. In: IJCAI, p.6903, 2013.

G. Aucher and &. Herzig, Exploring the Power of Converse Events, pp.51-74, 2011.
DOI : 10.1007/978-94-007-0074-1_4
URL : https://hal.archives-ouvertes.fr/hal-00557002

P. Barceló, D. Figueira, and &. Leonid-libkin, Graph Logics with Rational Relations, Logical Methods in Computer Science, vol.9, issue.3, 2013.

J. Van-benthem, J. Gerbrandy, T. Hoshi, and E. Pacuit, Merging frameworks for interaction, Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge , TARK '07, pp.491-52610, 2009.
DOI : 10.1145/1324249.1324262

J. Bernet, D. , and I. Walukiewicz, Permissive strategies: from parity games to safety games, RAIRO - Theoretical Informatics and Applications, vol.36, issue.3, pp.261-275, 2002.
DOI : 10.1051/ita:2002013
URL : https://hal.archives-ouvertes.fr/hal-00306411

J. Berstel, Transductions and context-free languages, Teubner Stuttgart, vol.4, 1979.
DOI : 10.1007/978-3-663-09367-1
URL : https://hal.archives-ouvertes.fr/hal-00619779

T. Bolander and &. Andersen, Epistemic planning for singleand multi-agent systems, Journal of Applied Non-Classical Logics, vol.3, issue.3, pp.9-34, 2011.
DOI : 10.1016/0010-0277(83)90004-5

C. C. Elgot and &. J. Mezei, On Relations Defined by Generalized Finite Automata, IBM Journal of Research and Development, vol.9, issue.1, pp.47-68, 1965.
DOI : 10.1147/rd.91.0047

M. Ghallab, D. S. Nau, and P. Traverso, Automated planning -theory and practice, 2004.

T. Hoshi and &. Yap, Dynamic epistemic logic with branching temporal structures, Synthese, vol.151, issue.2, pp.259-281, 2009.
DOI : 10.1007/s11229-009-9552-6

E. Benedikt-löwe, &. Pacuit, and . Witzel, DEL Planning and Some Tractable Cases, Lecture Notes in Computer Science, vol.6953, pp.179-192978, 2011.

B. Maubert and &. Pinchinat, Jumping Automata for Uniform Strategies, FSTTCS'13, pp.287-298, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01098741

B. Maubert and &. Pinchinat, A GENERAL NOTION OF UNIFORM STRATEGIES, International Game Theory Review, vol.16, issue.01, pp.10-1142, 2014.
DOI : 10.1142/S0219198914400040
URL : https://hal.archives-ouvertes.fr/hal-01098738

B. Maubert, S. Pinchinat, and L. Bozzelli, The Complexity of Synthesizing Uniform Strategies, SR, EPTCS 112, pp.115-122, 2013.
DOI : 10.4204/EPTCS.112.17
URL : https://hal.archives-ouvertes.fr/hal-01098745

A. Pnueli and &. R. Rosner, On the synthesis of an asynchronous reactive module, Proc. 16th Int. Coll. on Automata, Languages and Programming, ICALP'89, pp.652-671, 1989.
DOI : 10.1007/BFb0035790

S. Riedweg and &. Pinchinat, Quantified Mu-Calculus for Control Synthesis, Branislav Rovan & Peter Vojtás, pp.642-651978, 2003.
DOI : 10.1007/978-3-540-45138-9_58
URL : https://hal.archives-ouvertes.fr/inria-00071793

W. Thomas, On the synthesis of strategies in infinite games, STACS, pp.1-13, 1995.
DOI : 10.1007/3-540-59042-0_57

Y. Wang and &. Guillaume-aucher, An Alternative Axiomatization of DEL and Its Applications, p.6802, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00856470

Q. Yu, X. Wen, and &. Liu, Multi-Agent Epistemic Explanatory Diagnosis via Reasoning about Actions, pp.1183-1190, 2013.