1. de Alfaro, L., Henzinger, T.A., Kupferman, O.: Concurrent reachability games. In: 39th Annual Symposium on Foundations of Computer Science, FOCS. pp. 564–575. IEEE Computer Society (1998)
2. Aminof, B., Ball, T., Kupferman, O.: Reasoning about systems with transition fairness. In: 11th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning. LNCS, vol. 3452, pp. 194–208. Springer (2004)
3. Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press (2008)
4. Banerjee, T., Majumdar, R., Kaushik, M., Schmuck, A.K., Soudjani, S.: Fast symbolic algorithms for omega-regular games under strong transition fairness (2021), https://www.mpi-sws.org/tr/2020-007.pdf
5. Belta, C., Yordanov, B., Gol, E.A.: Formal methods for discrete-time dynamical systems, vol. 15. Springer (2017)