A number of extensions exist for Alternating-time Temporal Logic; some of these mix strategies and partial observability but, to the best of our knowledge, no work provides a unified framework for strategies, partial observability and fairness constraints. In this paper we propose ATLK^F_po, a logic mixing strategies under partial observability and epistemic properties of agents in a system with fairness constraints on states, and we provide a model checking algorithm for it.
Busard, S., Pecheur, C., Qu, H., & Raimondi, F. (2013). Reasoning about Strategies under Partial Observability and Fairness Constraints. Electronic Proceedings in Theoretical Computer Science, 112, 71-79. https://doi.org/10.4204/EPTCS.112.12 (Original work published 2013)