{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T02:44:21Z","timestamp":1782873861384,"version":"3.54.5"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032227515","type":"print"},{"value":"9783032227522","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T00:00:00Z","timestamp":1776297600000},"content-version":"vor","delay-in-days":105,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22752-2_28","type":"book-chapter","created":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:52:21Z","timestamp":1776289941000},"page":"547-565","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Fixpoints of Learned Functions: Chaotic Iteration and Simple Stochastic Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9357-5599","authenticated-orcid":false,"given":"Paolo","family":"Baldan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4343-1384","authenticated-orcid":false,"given":"Sebastian","family":"Gurke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4193-2889","authenticated-orcid":false,"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8307-503X","authenticated-orcid":false,"given":"Florian","family":"Wittbold","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,4,16]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Giorgio Bacci, Giovanni Bacci, Kim\u00a0G. Larsen, and Radu Mardare. On-the-fly exact computation of bisimilarity distances. Logical Methods in Computer Science, 13(2:13):1\u201325, 2017.","DOI":"10.23638\/LMCS-13(2:13)2017"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Giorgio Bacci, Giovanni Bacci, Kim\u00a0G. Larsen, Radu Mardare, Qiyi Tang, and Franck van Breugel. Computing probabilistic bisimilarity distances for probabilistic automata. Logical Methods in Computer Science, 17(1), 2021.","DOI":"10.23638\/LMCS-17(1:9)2021"},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Paolo Baldan, Sebastian Gurke, Barbara K\u00f6nig, Tommaso Padoan, and Florian Wittbold. Approximating fixpoints of approximated functions. In Ruzica Piskac and Zvonimir Rakamaric, editors, Proc. of CAV 2025 \u2013 Part\u00a0II, pages 193\u2013215. Springer, 2025. LNCS 15932.","DOI":"10.1007\/978-3-031-98679-6_9"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Paolo Baldan, Sebastian Gurke, Barbara K\u00f6nig, Tommaso Padoan, and Florian Wittbold. Approximating fixpoints of approximated functions, 2025. arXiv:2501.08950.","DOI":"10.1007\/978-3-031-98679-6_9"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Paolo Baldan, Sebastian Gurke, Barbara K\u00f6nig, and Florian Wittbold. Computing fixpoints of learned functions: Chaotic iteration and simple stochastic games, 2026. arXiv:2601.16142.","DOI":"10.1007\/978-3-032-22752-2_28"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Vasile Berinde. Iterative Approximation of Fixed Points, volume 1912 of Lecture Notes in Mathematics. Springer, 2007.","DOI":"10.1109\/SYNASC.2007.49"},{"key":"28_CR7","unstructured":"Dimitri P. Bertsekas and John N. Tsitsiklis. Neuro-Dynamic Programming. Athena Scientific, Belmont, Massachusetts, 1996."},{"key":"28_CR8","unstructured":"Anne Condon. The complexity of stochastic games. Information and Computation, 96(2):203\u2013224, 1992."},{"key":"28_CR9","unstructured":"Marie Duflo. Random Iterative Models. Number\u00a034 in Applications of Mathematics \u2013 Stochastic Modelling and Applied Probability. Springer, 1991. Translated by Stephen S. Wilson"},{"key":"28_CR10","doi-asserted-by":"crossref","unstructured":"Syyeda\u00a0Zainab Fatmi, Stefan Kiefer, David Parker, and Franck van Breugel. Robust probabilistic bisimilarity for labelled markov chains. In Ruzica Piskac and Zvonimir Rakamari\u0107, editors, Proceedings of CAV\u20192025, pages 254\u2013275. Springer, 2025.","DOI":"10.1007\/978-3-031-98679-6_12"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Andreas Frommer and Daniel\u00a0B. Szyld. On asynchronous iterations. Journal of Computational and Applied Mathematics, 123(1):201\u2013216, 2000. Numerical Analysis 2000. Vol. III: Linear Algebra.","DOI":"10.1016\/S0377-0427(00)00409-X"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Leslie\u00a0Pack Kaelbling, Michael\u00a0L Littman, and Andrew\u00a0W Moore. Reinforcement learning: A survey. Journal of artificial intelligence research, 4:237\u2013285, 1996.","DOI":"10.1613\/jair.301"},{"key":"28_CR13","unstructured":"Stefan Kiefer and Qiyi Tang. Approximate bisimulation minimisation. In Proc. of FSTTCS \u201921, volume 213 of LIPIcs, pages 48:1\u201348:16. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, 2021."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Tae-Hwa Kim and Hong-Kun Xu. Strong convergence of modified Mann iterations. Nonlinear Analysis: Theory, Methods & Applications, 61(1):51\u201360, 2005.","DOI":"10.1016\/j.na.2004.11.011"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Harold\u00a0J. Kushner and Dean\u00a0S. Clark. Stochastic Approximation Methods for Constrained and Unconstrained Systems. Number\u00a026 in Applied Mathematical Sciences. Springer, 1978","DOI":"10.1007\/978-1-4684-9352-8"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"H. Robbins and S. Monro. A stochastic approximation method. The Annals of Mathematical Statistics, 22(3):400\u2013407, 1951.","DOI":"10.1214\/aoms\/1177729586"},{"key":"28_CR17","unstructured":"Gavin\u00a0A Rummery and Mahesan Niranjan. On-line Q-learning using connectionist systems, volume\u00a037. University of Cambridge, Department of Engineering Cambridge, UK, 1994."},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Richard S. Sutton. Dyna, an integrated architecture for learning, planning, and reacting. SIGART Bulletin, 2(4):160\u2013163, 1991.","DOI":"10.1145\/122344.122348"},{"key":"28_CR19","unstructured":"Richard\u00a0S. Sutton. Planning by incremental dynamic programming. In Proc. of ML \u201991 (Conference on Machine Learning), pages 353\u2013357. Morgan Kaufmann, 1991."},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Franck van Breugel. Probabilistic bisimilarity distances. ACM SIGLOG News, 4(4):33\u201351, 2017.","DOI":"10.1145\/3157831.3157837"},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Franck van Breugel and James Worrell. The complexity of computing a bisimilarity pseudometric on probabilistic automata. In Horizons of the Mind. A Tribute to Prakash Panangaden \u2013 Essays Dedicated to Prakash Panangaden on the Occasion of His 60th Birthday, pages 191\u2013213. Springer, 2014. LNCS 8464.","DOI":"10.1007\/978-3-319-06880-0_10"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Christopher J. C. H. Watkins and Peter Dayan. Q-learning. Machine Learning, 8:279\u2013292, 1992.","DOI":"10.1023\/A:1022676722315"},{"key":"28_CR23","doi-asserted-by":"crossref","unstructured":"Yonghong Yao, Haiyun Zhou, andYeong-Cheng Liou. Strong convergence of a modified Krasnoselski-Mann iterative algorithm for non-expansive mappings. Journal of Applied Mathematics and Computing, 29:383\u2013389, 2008.","DOI":"10.1007\/s12190-008-0139-z"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22752-2_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T01:53:31Z","timestamp":1782870811000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22752-2_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032227515","9783032227522"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22752-2_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"16 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/about\/tacas\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}