{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:15:16Z","timestamp":1742912116518,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031158384"},{"type":"electronic","value":"9783031158391"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-15839-1_10","type":"book-chapter","created":{"date-parts":[[2022,8,28]],"date-time":"2022-08-28T18:02:38Z","timestamp":1661709758000},"page":"165-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Timed Games with\u00a0Bounded Window Parity Objectives"],"prefix":"10.1007","author":[{"given":"James C. A.","family":"Main","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mickael","family":"Randour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeremy","family":"Sproston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,29]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-540-45187-7_9","volume-title":"CONCUR 2003 - Concurrency Theory","author":"L de Alfaro","year":"2003","unstructured":"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\u2013158. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45187-7_9"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/3-540-44685-0_36","volume-title":"CONCUR 2001 \u2014 Concurrency Theory","author":"L de Alfaro","year":"2001","unstructured":"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\u2013550. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44685-0_36"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/inco.1993.1024","volume":"104","author":"R Alur","year":"1993","unstructured":"Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking in dense real-time. Inf. Comput. 104(1), 2\u201334 (1993). https:\/\/doi.org\/10.1006\/inco.1993.1024","journal-title":"Inf. Comput."},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theor. Comput. Sci."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-24537-9_1","volume-title":"Reachability Problems","author":"C Baier","year":"2015","unstructured":"Baier, C.: Reasoning about cost-utility constraints in probabilistic models. In: Boja\u0144czyk, M., Lasota, S., Potapov, I. (eds.) RP 2015. LNCS, vol. 9328, pp. 1\u20136. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24537-9_1"},{"key":"10_CR6","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Baier, C., Klein, J., Kl\u00fcppelholz, 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\u201318 July 2014, pp. 11:1\u201311:10. ACM (2014). https:\/\/doi.org\/10.1145\/2603088.2603162. http:\/\/dl.acm.org\/citation.cfm?id=2603088","DOI":"10.1145\/2603088.2603162"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/0204037","volume":"4","author":"TP Baker","year":"1975","unstructured":"Baker, T.P., Gill, J., Solovay, R.: Relativizations of the P =? NP question. SIAM J. Comput. 4(4), 431\u2013442 (1975). https:\/\/doi.org\/10.1137\/0204037","journal-title":"SIAM J. Comput."},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"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\u201314 July 2017, Warsaw, Poland. LIPIcs, vol. 80, pp. 121:1\u2013121: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","DOI":"10.4230\/LIPIcs.ICALP.2017.121"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"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\u201313 December 2019, Bombay, India. LIPIcs, vol. 150, pp. 32:1\u201332:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2019.32","DOI":"10.4230\/LIPIcs.FSTTCS.2019.32"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Bouyer, P., Brihaye, T., Randour, M., Rivi\u00e8re, 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\u201322 September 2020. EPTCS, vol. 326, pp. 149\u2013165 (2020). https:\/\/doi.org\/10.4204\/EPTCS.326.10","DOI":"10.4204\/EPTCS.326.10"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1016\/j.jcss.2016.09.009","volume":"84","author":"T Br\u00e1zdil","year":"2017","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Forejt, V., Kucera, A.: Trading performance for stability in Markov decision processes. J. Comput. Syst. Sci. 84, 144\u2013170 (2017). https:\/\/doi.org\/10.1016\/j.jcss.2016.09.009","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Br\u00e1zdil, T., Forejt, V., Kucera, A., Novotn\u00fd, P.: Stability in graphs and games. In: Desharnais and Jagadeesan [24], pp. 10:1\u201310:14. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2016.10. http:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-017-0","DOI":"10.4230\/LIPIcs.CONCUR.2016.10"},{"key":"10_CR14","unstructured":"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"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.ic.2016.10.011","volume":"254","author":"V Bruy\u00e8re","year":"2017","unstructured":"Bruy\u00e8re, V., Filiot, E., Randour, M., Raskin, J.: Meet your expectations with guarantees: beyond worst-case synthesis in quantitative games. Inf. Comput. 254, 259\u2013295 (2017). https:\/\/doi.org\/10.1016\/j.ic.2016.10.011","journal-title":"Inf. Comput."},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Bruy\u00e8re, 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\u201316 September 2016. EPTCS, vol. 226, pp. 135\u2013148 (2016). https:\/\/doi.org\/10.4204\/EPTCS.226.10","DOI":"10.4204\/EPTCS.226.10"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Bruy\u00e8re, V., Hautem, Q., Raskin, J.: On the complexity of heterogeneous multidimensional games. In: Desharnais and Jagadeesan [24], pp. 11:1\u201311:15. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2016.11. http:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-017-0","DOI":"10.4230\/LIPIcs.CONCUR.2016.11"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"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\u201323 June 2017, pp. 252\u2013263. ACM (2017). https:\/\/doi.org\/10.1145\/3055399.3055409","DOI":"10.1145\/3055399.3055409"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ic.2015.03.010","volume":"242","author":"K Chatterjee","year":"2015","unstructured":"Chatterjee, K., Doyen, L., Randour, M., Raskin, J.: Looking at mean-payoff and total-payoff through windows. Inf. Comput. 242, 25\u201352 (2015). https:\/\/doi.org\/10.1016\/j.ic.2015.03.010","journal-title":"Inf. Comput."},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Henzinger, T.A., Horn, F.: Finitary winning in omega-regular games. ACM Trans. Comput. Log. 11(1), 1:1\u20131:27 (2009). https:\/\/doi.org\/10.1145\/1614431.1614432","DOI":"10.1145\/1614431.1614432"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-21254-3_17","volume-title":"Language and Automata Theory and Applications","author":"K Chatterjee","year":"2011","unstructured":"Chatterjee, K., Henzinger, T.A., Horn, F.: The complexity of request-response games. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 227\u2013237. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21254-3_17"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-71389-0_12","volume-title":"Foundations of Software Science and Computational Structures","author":"K Chatterjee","year":"2007","unstructured":"Chatterjee, K., Henzinger, T.A., Piterman, N.: Generalized parity games. In: Seidl, H. (ed.) FoSSaCS 2007. LNCS, vol. 4423, pp. 153\u2013167. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71389-0_12"},{"key":"10_CR23","doi-asserted-by":"publisher","unstructured":"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","DOI":"10.2168\/LMCS-7(4:8)2011"},{"key":"10_CR24","unstructured":"Desharnais, J., Jagadeesan, R. (eds.): 27th International Conference on Concurrency Theory, CONCUR 2016, 23\u201326 August 2016, Qu\u00e9bec City, Canada. LIPIcs, vol. 59. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016). http:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-017-0"},{"issue":"8","key":"10_CR25","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s00236-017-0304-7","volume":"55","author":"P Hunter","year":"2017","unstructured":"Hunter, P., P\u00e9rez, G.A., Raskin, J.-F.: Looking at mean payoff through foggy windows. Acta Informatica 55(8), 627\u2013647 (2017). https:\/\/doi.org\/10.1007\/s00236-017-0304-7","journal-title":"Acta Informatica"},{"issue":"2","key":"10_CR26","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s10703-009-0067-z","volume":"34","author":"O Kupferman","year":"2009","unstructured":"Kupferman, O., Piterman, N., Vardi, M.Y.: From liveness to promptness. Formal Methods Syst. Des. 34(2), 83\u2013103 (2009). https:\/\/doi.org\/10.1007\/s10703-009-0067-z","journal-title":"Formal Methods Syst. Des."},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"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\u201327 August 2021, Virtual Conference. LIPIcs, vol. 203, pp. 25:1\u201325:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2021.25","DOI":"10.4230\/LIPIcs.CONCUR.2021.25"},{"key":"10_CR28","unstructured":"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"},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-59042-0_76","volume-title":"STACS 95","author":"O Maler","year":"1995","unstructured":"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\u2013242. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-59042-0_76"},{"issue":"2","key":"10_CR30","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/s10703-012-0177-x","volume":"43","author":"G Norman","year":"2013","unstructured":"Norman, G., Parker, D., Sproston, J.: Model checking for probabilistic timed automata. Formal Methods Syst. Des. 43(2), 164\u2013190 (2013). https:\/\/doi.org\/10.1007\/s10703-012-0177-x","journal-title":"Formal Methods Syst. Des."},{"key":"10_CR31","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/978-3-319-00395-5_90","volume-title":"European Conference on Complex Systems","author":"M Randour","year":"2013","unstructured":"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\u2013738. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-00395-5_90"},{"key":"10_CR32","doi-asserted-by":"publisher","unstructured":"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\u201313 December 2018, Ahmedabad, India. LIPIcs, vol.\u00a0122, pp. 38:1\u201338: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","DOI":"10.4230\/LIPIcs.FSTTCS.2018.38"},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-45089-0_3","volume-title":"Implementation and Application of Automata","author":"N Wallmeier","year":"2003","unstructured":"Wallmeier, N., H\u00fctten, 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\u201322. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45089-0_3"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-15839-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T23:16:09Z","timestamp":1662074169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-15839-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031158384","9783031158391"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-15839-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"formats2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}