de Alfaro, L., Faella, M., Henzinger, T.A., Majumdar, R., Stoelinga, M.: The element of surprise in timed games. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 144–158. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45187-7 9
de Alfaro, L., Henzinger, T.A., Majumdar, R.: Symbolic algorithms for infinite-state games. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 536–550. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-44685-0 36
Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking in dense real-time. Inf. Comput. 104(1), 2–34 (1993). https://doi.org/10.1006/inco.1993.1024
Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994). https://doi.org/10.1016/0304-3975(94)90010-8
Baier, C.: Reasoning about cost-utility constraints in probabilistic models. In: Bojańczyk, M., Lasota, S., Potapov, I. (eds.) RP 2015. LNCS, vol. 9328, pp. 1–6. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-24537-9 1
Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)
Baier, C., Klein, J., Klüppelholz, S., Wunderlich, S.: Weight monitoring with linear temporal logic: complexity and decidability. In: Henzinger, T.A., Miller, D. (eds.) Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS 2014, Vienna, Austria, 14–18 July 2014, pp. 11:1–11:10. ACM (2014). https://doi.org/10.1145/2603088.2603162. http://dl. acm.org/citation.cfm?id=2603088
Baker, T.P., Gill, J., Solovay, R.: Relativizations of the P =? NP question. SIAM J. Comput. 4(4), 431–442 (1975). https://doi.org/10.1137/0204037
Berthon, R., Randour, M., Raskin, J.: Threshold constraints with guarantees for parity objectives in Markov decision processes. In: Chatzigiannakis, I., Indyk, P., Kuhn, F., Muscholl, A. (eds.) 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, 10–14 July 2017, Warsaw, Poland. LIPIcs, vol. 80, pp. 121:1–121:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017). https://doi.org/10.4230/LIPIcs.ICALP.2017.121. http://www. dagstuhl.de/dagpub/978-3-95977-041-5
Bordais, B., Guha, S., Raskin, J.: Expected window mean-payoff. In: Chattopadhyay, A., Gastin, P. (eds.) 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2019, 11–13 December 2019, Bombay, India. LIPIcs, vol. 150, pp. 32:1–32:15. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2019). https://doi.org/10.4230/LIPIcs.FSTTCS. 2019.32
Bouyer, P., Brihaye, T., Randour, M., Rivière, C., Vandenhove, P.: Decisiveness of stochastic systems and its application to hybrid models. In: Raskin, J., Bresolin, D. (eds.) Proceedings 11th International Symposium on Games, Automata, Logics, and Formal Verification, GandALF 2020, Brussels, Belgium, 21–22 September 2020. EPTCS, vol. 326, pp. 149–165 (2020). https://doi.org/10.4204/EPTCS.326. 10
Brázdil, T., Chatterjee, K., Forejt, V., Kucera, A.: Trading performance for stability in Markov decision processes. J. Comput. Syst. Sci. 84, 144–170 (2017). https://doi.org/10.1016/j.jcss.2016.09.009
Brázdil, T., Forejt, V., Kucera, A., Novotný, P.: Stability in graphs and games. In: Desharnais and Jagadeesan [24], pp. 10:1–10:14. https://doi.org/10.4230/LIPIcs. CONCUR.2016.10. http://www.dagstuhl.de/dagpub/978-3-95977-017-0
Brihaye, T., Delgrange, F., Oualhadj, Y., Randour, M.: Life is random, time is not: Markov decision processes with window objectives. Log. Methods Comput. Sci. 16(4) (2020). https://lmcs.episciences.org/6975
Bruyère, V., Filiot, E., Randour, M., Raskin, J.: Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games. Inf. Comput. 254, 259–295 (2017). https://doi.org/10.1016/j.ic.2016.10.011
Bruyère, V., Hautem, Q., Randour, M.: Window parity games: an alternative approach toward parity games with time bounds. In: Cantone, D., Delzanno, G. (eds.) Proceedings of the Seventh International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2016, Catania, Italy, 14–16 September 2016. EPTCS, vol. 226, pp. 135–148 (2016). https://doi.org/10.4204/EPTCS.226.10
Bruyère, V., Hautem, Q., Raskin, J.: On the complexity of heterogeneous multidimensional games. In: Desharnais and Jagadeesan [24], pp. 11:1–11:15. https://doi.org/10.4230/LIPIcs.CONCUR.2016.11. http://www.dagstuhl.de/dagpub/978-3-95977-017-0
Calude, C.S., Jain, S., Khoussainov, B., Li, W., Stephan, F.: Deciding parity games in quasipolynomial time. In: Hatami, H., McKenzie, P., King, V. (eds.) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, 19–23 June 2017, pp. 252–263. ACM (2017). https://doi.org/10.1145/3055399.3055409
Chatterjee, K., Doyen, L., Randour, M., Raskin, J.: Looking at mean-payoff and total-payoff through windows. Inf. Comput. 242, 25–52 (2015). https://doi.org/10.1016/j.ic.2015.03.010
Chatterjee, K., Henzinger, T.A., Horn, F.: Finitary winning in omega-regular games. ACM Trans. Comput. Log. 11(1), 1:1–1:27 (2009). https://doi.org/10. 1145/1614431.1614432
Chatterjee, K., Henzinger, T.A., Horn, F.: The complexity of request-response games. In: Dediu, A.-H., Inenaga, S., Martín-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 227–237. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-21254-3 17
Chatterjee, K., Henzinger, T.A., Piterman, N.: Generalized parity games. In: Seidl, H. (ed.) FoSSaCS 2007. LNCS, vol. 4423, pp. 153–167. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-71389-0 12
Chatterjee, K., Henzinger, T.A., Prabhu, V.S.: Timed parity games: complexity and robustness. Log. Methods Comput. Sci. 7(4) (2011). https://doi.org/10.2168/LMCS-7(4:8)2011
Desharnais, J., Jagadeesan, R. (eds.): 27th International Conference on Concurrency Theory, CONCUR 2016, 23–26 August 2016, Québec City, Canada. LIPIcs, vol. 59. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2016). http://www. dagstuhl.de/dagpub/978-3-95977-017-0
Hunter, P., Pérez, G.A., Raskin, J.-F.: Looking at mean payoff through foggy windows. Acta Informatica 55(8), 627–647 (2017). https://doi.org/10.1007/s00236-017-0304-7
Kupferman, O., Piterman, N., Vardi, M.Y.: From liveness to promptness. Formal Methods Syst. Des. 34(2), 83–103 (2009). https://doi.org/10.1007/s10703-009-0067-z
Main, J.C.A., Randour, M., Sproston, J.: Time flies when looking out of the window: timed games with window parity objectives. In: Haddad, S., Varacca, D. (eds.) 32nd International Conference on Concurrency Theory, CONCUR 2021, 24–27 August 2021, Virtual Conference. LIPIcs, vol. 203, pp. 25:1–25:16. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2021). https://doi.org/10. 4230/LIPIcs.CONCUR.2021.25
Main, J.C.A., Randour, M., Sproston, J.: Timed games with bounded window parity objectives. CoRR abs/2205.04197 (2022). https://doi.org/10.48550/arXiv. 2205.04197
Maler, O., Pnueli, A., Sifakis, J.: On the synthesis of discrete controllers for timed systems. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 229– 242. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-59042-0 76
Norman, G., Parker, D., Sproston, J.: Model checking for probabilistic timed automata. Formal Methods Syst. Des. 43(2), 164–190 (2013). https://doi.org/10. 1007/s10703-012-0177-x
Randour, M.: Automated synthesis of reliable and efficient systems through game theory: a case study. In: Gilbert, T., Kirkilionis, M., Nicolis, G. (eds.) ECCS 2012, pp. 731–738. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-00395-5 90
Roux, S.L., Pauly, A., Randour, M.: Extending finite-memory determinacy by Boolean combination of winning conditions. In: Ganguly, S., Pandya, P.K. (eds.) 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2018, 11–13 December 2018, Ahmedabad, India. LIPIcs, vol. 122, pp. 38:1–38:20. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018). https://doi.org/10.4230/LIPIcs.FSTTCS.2018.38. http://www. dagstuhl.de/dagpub/978-3-95977-093-4
Wallmeier, N., Hütten, P., Thomas, W.: Symbolic synthesis of finite-state controllers for request-response specifications. In: Ibarra, O.H., Dang, Z. (eds.) CIAA 2003. LNCS, vol. 2759, pp. 11–22. Springer, Heidelberg (2003). https://doi.org/10. 1007/3-540-45089-0 3
