{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:20:57Z","timestamp":1743042057925,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031787089"},{"type":"electronic","value":"9783031787096"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-78709-6_5","type":"book-chapter","created":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:41Z","timestamp":1738361441000},"page":"89-109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Decremental Algorithm for\u00a0Fair B\u00fcchi Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4757-1631","authenticated-orcid":false,"given":"Irmak","family":"Sa\u011flam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2801-639X","authenticated-orcid":false,"given":"Anne-Kathrin","family":"Schmuck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Munko","family":"Tsyrempilon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"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\u201330 October 2020, pp. 20\u201328. AAAI Press (2020). https:\/\/ojs.aaai.org\/index.php\/ICAPS\/article\/view\/6641","DOI":"10.1609\/icaps.v30i1.6641"},{"key":"5_CR2","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press (2008)"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Banerjee, T., Majumdar, R., Mallik, K., Schmuck, A., Soudjani, S.: Fast symbolic algorithms for omega-regular games under strong transition fairness. TheoretiCS 2 (2023). https:\/\/doi.org\/10.46298\/theoretics.23.4","DOI":"10.46298\/theoretics.23.4"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Belta, C., Yordanov, B., Gol, E.A.: Formal Methods for Discrete-Time Dynamical Systems, vol.\u00a015. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-50763-7","DOI":"10.1007\/978-3-319-50763-7"},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/s10703-012-0170-4","volume":"42","author":"K Chatterjee","year":"2013","unstructured":"Chatterjee, K., de Alfaro, L., Faella, M., Majumdar, R., Raman, V.: Code aware resource management. Formal Methods Syst. Des. 42(2), 146\u2013174 (2013). https:\/\/doi.org\/10.1007\/s10703-012-0170-4","journal-title":"Formal Methods Syst. Des."},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Henzinger, M.: Efficient and dynamic algorithms for alternating b\u00fcchi games and maximal end-component decomposition. J. ACM 61(3) (2014). https:\/\/doi.org\/10.1145\/2597631","DOI":"10.1145\/2597631"},{"issue":"1\u20132","key":"5_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0004-3702(02)00374-0","volume":"147","author":"A Cimatti","year":"2003","unstructured":"Cimatti, A., Pistore, M., Roveri, M., Traverso, P.: Weak, strong, and strong cyclic planning via symbolic model checking. Artif. Intell. 147(1\u20132), 35\u201384 (2003). https:\/\/doi.org\/10.1016\/S0004-3702(02)00374-0","journal-title":"Artif. Intell."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/10720246_3","volume-title":"Recent Advances in AI Planning","author":"M Daniele","year":"2000","unstructured":"Daniele, M., Traverso, P., Vardi, M.Y.: Strong cyclic planning revisited. In: Biundo, S., Fox, M. (eds.) ECP 1999. LNCS (LNAI), vol. 1809, pp. 35\u201348. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10720246_3"},{"key":"5_CR9","doi-asserted-by":"publisher","unstructured":"D\u2019Ippolito, N., Rodr\u00edguez, N., Sardi\u00f1a, S.: Fully observable non-deterministic planning as assumption-based reactive synthesis. J. Artif. Intell. Res. 61, 593\u2013621 (2018). https:\/\/doi.org\/10.1613\/jair.5562","DOI":"10.1613\/jair.5562"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Jutla, C.S.: On simultaneously determinizing and complementing omega-automata. In: Proceedings of the Fourth Annual Symposium on Logic in Computer Science LICS 1989, Pacific Grove, California, USA, 5\u20138 June 1989, pp. 333\u2013342. IEEE Computer Society (1989)","DOI":"10.1109\/LICS.1989.39188"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Emerson, E.A., Jutla, C.S.: The complexity of tree automata and logics of programs 29, 132\u2013158 (1999). https:\/\/doi.org\/10.1137\/S0097539793304741","DOI":"10.1137\/S0097539793304741"},{"key":"5_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N Francez","year":"1986","unstructured":"Francez, N.: Fairness. Springer, Heidelberg (1986)"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Hausmann, D., Piterman, N., Sa\u011flam, I., Schmuck, A.: Fair omega-regular games. In: Kobayashi, N., Worrell, J. (eds.) Foundations of Software Science and Computation Structures - 27th International Conference, FoSSaCS 2024, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2024, Luxembourg City, Luxembourg, 6\u201311 April 2024, Proceedings, Part I. LNCS, vol. 14574, pp. 13\u201333. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-57228-9_2","DOI":"10.1007\/978-3-031-57228-9_2"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Jacobs, S., et al.: The reactive synthesis competition (SYNTCOMP): 2018\u20132021. CoRR abs\/2206.00251 (2022). https:\/\/doi.org\/10.48550\/arXiv.2206.00251","DOI":"10.48550\/arXiv.2206.00251"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-46541-3_24","volume-title":"STACS 2000","author":"M Jurdzi\u0144ski","year":"2000","unstructured":"Jurdzi\u0144ski, M.: Small progress measures for solving parity games. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol. 1770, pp. 290\u2013301. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46541-3_24"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Majumdar, R., Mallik, K., Rychlicki, M., Schmuck, A., Soudjani, S.: A flexible toolchain for symbolic Rabin games under fair and stochastic uncertainties. In: Enea, C., Lal, A. (eds.) Computer Aided Verification - 35th International Conference, CAV 2023, Paris, France, 17\u201322 July 2023, Proceedings, Part III. LNCS, vol. 13966, pp. 3\u201315. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37709-9_1","DOI":"10.1007\/978-3-031-37709-9_1"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Majumdar, R., Mallik, K., Schmuck, A.K., Soudjani, S.: Symbolic control for stochastic systems via finite parity games. Nonlinear Anal. Hybrid Syst. 51, 101430 (2024). https:\/\/doi.org\/10.1016\/j.nahs.2023.101430","DOI":"10.1016\/j.nahs.2023.101430"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Majumdar, R., Mallik, K., Soudjani, S.: Symbolic controller synthesis for b\u00fcchi specifications on stochastic systems. In: Ames, A.D., Seshia, S.A., Deshmukh, J. (eds.) HSCC 2020: 23rd ACM International Conference on Hybrid Systems: Computation and Control, Sydney, New South Wales, Australia, 21\u201324 April 2020, pp. 14:1\u201314:11. ACM (2020). https:\/\/doi.org\/10.1145\/3365365.3382214","DOI":"10.1145\/3365365.3382214"},{"issue":"2","key":"5_CR19","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"DA Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Ann. Math. 102(2), 363\u2013371 (1975)","journal-title":"Ann. Math."},{"issue":"2","key":"5_CR20","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10626-017-0243-z","volume":"27","author":"P Nilsson","year":"2017","unstructured":"Nilsson, P., Ozay, N., Liu, J.: Augmented finite transition systems as abstractions for control synthesis. Discrete Event Dyn. Syst. 27(2), 301\u2013340 (2017). https:\/\/doi.org\/10.1007\/s10626-017-0243-z","journal-title":"Discrete Event Dyn. Syst."},{"key":"5_CR21","unstructured":"Pistore, M., Traverso, P.: Planning as model checking for extended goals in non-deterministic domains. In: International Joint Conference on Artificial Intelligence (2001). https:\/\/api.semanticscholar.org\/CorpusID:18603460"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Queille, J., Sifakis, J.: Fairness and related properties in transition systems - a temporal logic to deal with fairness. Acta Informatica 19, 195\u2013220 (1983). https:\/\/doi.org\/10.1007\/BF00265555","DOI":"10.1007\/BF00265555"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Ram\u00edrez, M., Sardi\u00f1a, S.: Directed fixed-point regression-based planning for non-deterministic domains. In: Chien, S.A., Do, M.B., Fern, A., Ruml, W. (eds.) Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, ICAPS 2014, Portsmouth, New Hampshire, USA, June 21\u201326 2014. AAAI (2014). https:\/\/doi.org\/10.1609\/icaps.v24i1.13629","DOI":"10.1609\/icaps.v24i1.13629"},{"key":"5_CR24","doi-asserted-by":"publisher","unstructured":"Sa\u011flam, I., Schmuck, A.: Solving odd-fair parity games. In: Bouyer, P., Srinivasan, S. (eds.) 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2023, 18\u201320 December 2023, IIIT Hyderabad, Telangana, India. LIPIcs, vol.\u00a0284, pp. 34:1\u201334:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2023.34","DOI":"10.4230\/LIPICS.FSTTCS.2023.34"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Shiloach, Y., Even, S.: An on-line edge-deletion problem. J. ACM 28(1), 1\u20134 (1981). https:\/\/doi.org\/10.1145\/322234.322235","DOI":"10.1145\/322234.322235"},{"key":"5_CR26","doi-asserted-by":"publisher","unstructured":"Tabuada, P.: Verification and Control of Hybrid Systems - A Symbolic Approach. Springer, New York (2009). https:\/\/doi.org\/10.1007\/978-1-4419-0224-5","DOI":"10.1007\/978-1-4419-0224-5"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5, 285\u2013309 (1955). https:\/\/api.semanticscholar.org\/CorpusID:13651629","DOI":"10.2140\/pjm.1955.5.285"},{"issue":"4","key":"5_CR28","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/S0167-6911(97)00106-0","volume":"33","author":"JG Thistle","year":"1998","unstructured":"Thistle, J.G., Malham\u00e9, R.: Control of $$\\omega $$-automata under state fairness assumptions. Syst. Control Lett. 33(4), 265\u2013274 (1998)","journal-title":"Syst. Control Lett."},{"key":"5_CR29","unstructured":"Verver, M.: Practical improvements to parity game solving (2013). https:\/\/api.semanticscholar.org\/CorpusID:44613658"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78709-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:10:49Z","timestamp":1738361449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78709-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031787089","9783031787096"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78709-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kyoto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}