[. References and . Ågotnes, Alternating-Time Temporal Logics with Irrevocable Strategies, TARK'07, pp.15-24, 2007.

[. Alur, L. Torre, ;. R. Alur, and S. L. Torre, Deterministic generators and games for LTL fragments, ACM Trans. Comput. Log, vol.5, issue.1, pp.1-25, 2004.

[. Alur, jMocha: A model checking tool that exploits design structure, ICSE'01, pp.835-836, 2001.

[. Alur, Bisimulations for logics of strategies: A study in expressiveness and verification, KR'18, vol.49, pp.425-434, 2002.

[. Bouyer, Meet your expectations with guarantees: Beyond worstcase synthesis in quantitative games. CoRR,abs/1309, FSTTCS'15, vol.5439, pp.380-403, 2009.

[. Cermák, Verifying and synthesising multi-agent systems against one-goal strategy logic specifications, AAAI'15, pp.2038-2044, 2014.

[. Cermák, The complexity of partial-observation stochastic parity games with finite-memory strategies, Strategy Logic. I&C, vol.I&C, pp.242-257, 2010.

[. Cimatti, NUSMV2: An open-source tool for symbolic model checking, CAV'02, pp.479-483, 2002.

[. Gardy, MCMAS: A model checker for the verification of multi-agent systems. Software Tools for Technology Transfer, Cooperation, knowledge, and time: Alternatingtime temporal epistemic logic and its applications. Studia Logica, vol.34, pp.1-1, 2002.

;. S. Vester and . Vester, Alternating-time temporal logic with finite-memory strategies, GandALF'13, pp.194-207, 2013.