Rajeev Alur & Thomas A. Henzinger (1998):
Finitary Fairness.
ACM Trans. Program. Lang. Syst. 20(6),
pp. 1171–1194,
doi:10.1145/295656.295659.
Benjamin Aminof & Sasha Rubin (2017):
First-cycle games.
Information and Computation 254,
pp. 195–216,
doi:10.1016/j.ic.2016.10.008.
Julien Bernet, David Janin & Igor Walukiewicz (2002):
Permissive strategies: from parity games to safety games.
RAIRO Theor. Informatics Appl. 36(3),
pp. 261–275,
doi:10.1051/ita:2002013.
Armin Biere, Alessandro Cimatti, Edmund M. Clarke & Yunshan Zhu (1999):
Symbolic Model Checking without BDDs.
In: Rance Cleaveland: TACAS '99, Proceedings,
LNCS 1579.
Springer,
pp. 193–207,
doi:10.1007/3-540-49059-0_14.
Julian Bradfield & Colin Stirling (2007):
Modal mu-calculi,
pp. 721–756.
Elsevier,
doi:10.1016/s1570-2464(07)80015-2.
Doron Bustan, Orna Kupferman & Moshe Y. Vardi (2004):
A Measured Collapse of the Modal μ-Calculus Alternation Hierarchy.
In: Volker Diekert & Michel Habib: STACS 2004, 21st Annual Symposium on Theoretical Aspects of Computer Science, Proceedings,
LNCS 2996.
Springer,
pp. 522–533,
doi:10.1007/978-3-540-24749-4_46.
Valentin Goranko, Antti Kuusisto & Raine Rönnholm:
Game-Theoretic Semantics for ATL+ with Applications to Model Checking.
To appear in Information and Computation.
Valentin Goranko, Antti Kuusisto & Raine Rönnholm (2016):
Game-Theoretic Semantics for Alternating-Time Temporal Logic.
In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, AAMAS,
pp. 671–679.
Valentin Goranko, Antti Kuusisto & Raine Rönnholm (2017):
CTL with Finitely Bounded Semantics.
In: Sven Schewe, Thomas Schneider & Jef Wijsen: 24th International Symposium on Temporal Representation and Reasoning, TIME,
LIPIcs 90.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
pp. 14:1–14:19,
doi:10.4230/LIPIcs.TIME.2017.14.
Valentin Goranko, Antti Kuusisto & Raine Rönnholm (2017):
Game-Theoretic Semantics for ATL+ with Applications to Model Checking.
In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS,
pp. 1277–1285.
Valentin Goranko, Antti Kuusisto & Raine Rönnholm (2018):
Game-Theoretic Semantics for Alternating-Time Temporal Logic.
ACM Trans. Comput. Log. 19(3),
pp. 17:1–17:38,
doi:10.1145/3179998.
Valentin Goranko, Antti Kuusisto & Raine Rönnholm (2019):
Alternating-time temporal logic ATL with finitely bounded semantics.
Theor. Comput. Sci. 797,
pp. 129–155,
doi:10.1016/j.tcs.2019.05.029.
Lauri Hella, Antti Kuusisto & Raine Rönnholm (2017):
Bounded game-theoretic semantics for modal mu-calculus.
CoRR abs/1706.00753.
Available at https://arxiv.org/pdf/1706.00753v1.pdf.
Lauri Hella, Antti Kuusisto & Raine Rönnholm (2020):
Bounded game-theoretic semantics for modal mu-calculus.
CoRR abs/1706.00753.
Available at https://arxiv.org/pdf/1706.00753v2.pdf.
Lauri Hella & Miikka Vilander (2019):
Formula size games for modal logic and μ-calculus.
J. Log. Comput. 29(8),
pp. 1311–1344,
doi:10.1093/logcom/exz025.
Neil Immerman (1999):
Descriptive complexity.
Graduate texts in computer science.
Springer,
doi:10.1007/978-1-4612-0539-5.
Dexter Kozen (1983):
Results on the Propositional mu-Calculus.
Theor. Comput. Sci. 27,
pp. 333–354,
doi:10.1016/0304-3975(82)90125-6.
Orna Kupferman, Nir Piterman & Moshe Y. Vardi (2007):
From Liveness to Promptness.
In: Werner Damm & Holger Hermanns: Computer Aided Verification, 19th International Conference, CAV, Proceedings,
LNCS 4590.
Springer,
pp. 406–419,
doi:10.1007/978-3-540-73368-3_44.
Antti Kuusisto (2014):
Some Turing-Complete Extensions of First-Order Logic.
In: Adriano Peron & Carla Piazza: GandALF 2014,
EPTCS 161,
pp. 4–17,
doi:10.4204/EPTCS.161.4.
Antti Kuusisto (2019):
On Games and Computation.
CoRR abs/1910.14603.
Wojciech Penczek, Bozena Wozna & Andrzej Zbrzezny (2002):
Bounded Model Checking for the Universal Fragment of CTL.
Fundam. Inform. 51(1-2),
pp. 135–156.
Robert S. Streett & E. Allen Emerson (1989):
An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus.
Inf. Comput. 81(3),
pp. 249–264,
doi:10.1016/0890-5401(89)90031-X.