1. Aminof, B., Giacomo, G.D., Rubin, S.: Stochastic fairness and language-theoretic fairness in planning in nondeterministic domains. In: Beck, J.C., Buffet, O., Hoffmann, J., Karpas, E., Sohrabi, S. (eds.) Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, Nancy, France, 26–30 October 2020, pp. 20–28. AAAI Press (2020)
2. LNCS;A Anand,2023
3. Apt, K.R., Grädel, E. (eds.): Lectures in Game Theory for Computer Scientists. Cambridge University Press, Cambridge (2011)
4. Arnold, A., Niwiński, D., Parys, P.: A quasi-polynomial black-box algorithm for fixed point evaluation. In: Baier, C., Goubault-Larrecq, J. (eds.) 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, 25–28 January 2021, Ljubljana, Slovenia (Virtual Conference). LIPIcs, vol. 183, pp. 9:1–9:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
5. Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)