{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:36:31Z","timestamp":1761431791746,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032087065"},{"type":"electronic","value":"9783032087072"}],"license":[{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T00:00:00Z","timestamp":1761436800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-08707-2_6","type":"book-chapter","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:36Z","timestamp":1761431616000},"page":"109-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Widest Path Games and\u00a0Maximality Inheritance in\u00a0Bounded Value Iteration for\u00a0Stochastic Games"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-5406-7480","authenticated-orcid":false,"given":"Kittiphon","family":"Phalakarn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-7705-9609","authenticated-orcid":false,"given":"Yun Chen","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8300-4650","authenticated-orcid":false,"given":"Ichiro","family":"Hasuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,26]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","unstructured":"Andersson, D., Miltersen, P.B.: The complexity of solving stochastic games on graphs. In: Dong, Y., Du, D., Ibarra, O.H. (eds.) ISAAC 2009. vol.\u00a05878, pp. 112\u2013121. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-10631-6_13","DOI":"10.1007\/978-3-642-10631-6_13"},{"key":"6_CR2","unstructured":"Andriushchenko, R., et al.: Tools at the frontiers of quantitative verification. In: Beyer, D., Hartmanns, A., Kordon, F. (eds.) TOOLympics Challenge 2023, pp. 90\u2013146. Springer (2025)"},{"key":"6_CR3","doi-asserted-by":"publisher","unstructured":"Azeem, M., Evangelidis, A., Kret\u00ednsk\u00fd, J., Slivinskiy, A., Weininger, M.: Optimistic and topological value iteration for simple stochastic games. In: Bouajjani, A., Hol\u00edk, L., Wu, Z. (eds.) ATVA 2022, vol. 13505, pp. 285\u2013302. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-19992-9_18","DOI":"10.1007\/978-3-031-19992-9_18"},{"key":"6_CR4","doi-asserted-by":"publisher","unstructured":"Azeem, M., Kret\u00ednsk\u00fd, J., Weininger, M.: Sound value iteration for simple stochastic games. CoRR abs\/2411.11549 (2024). https:\/\/doi.org\/10.48550\/arXiv.2411.11549","DOI":"10.48550\/arXiv.2411.11549"},{"key":"6_CR5","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press (2008)"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0012-365X(91)90413-V","volume":"98","author":"A Baranga","year":"1991","unstructured":"Baranga, A.: The contraction principle as a particular case of Kleene\u2019s fixed point theorem. Discret. Math. 98(1), 75\u201379 (1991)","journal-title":"Discret. Math."},{"issue":"1","key":"6_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Q. Appl. Math. 16(1), 87\u201390 (1958)","journal-title":"Q. Appl. Math."},{"key":"6_CR8","doi-asserted-by":"publisher","unstructured":"Br\u00e1zdil, T., et al.: Verification of Markov decision processes using learning algorithms. In: Cassez, F., Raskin, J. (eds.) ATVA 2014, vol.\u00a08837, pp. 98\u2013114. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-11936-6_8","DOI":"10.1007\/978-3-319-11936-6_8"},{"key":"6_CR9","doi-asserted-by":"publisher","unstructured":"Calinescu, R., Kikuchi, S., Johnson, K.: Compositional reverification of probabilistic safety properties for large-scale complex IT systems. In: Calinescu, R., Garlan, D. (eds.) Monterey Workshop 2012, vol.\u00a07539, pp. 303\u2013329. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-34059-8_16","DOI":"10.1007\/978-3-642-34059-8_16"},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Fijalkow, N.: A reduction from parity games to simple stochastic games. In: D\u2019Agostino, G., Torre, S.L. (eds.) GandALF 2011. EPTCS, vol.\u00a054, pp. 74\u201386 (2011). https:\/\/doi.org\/10.4204\/EPTCS.54.6","DOI":"10.4204\/EPTCS.54.6"},{"key":"6_CR11","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Henzinger, T.A.: Value iteration. In: Grumberg, O., Veith, H. (eds.) 25 Years of Model Checking - History, Achievements, Perspectives. Lecture Notes in Computer Science, vol.\u00a05000, pp. 107\u2013138. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-69850-0_7","DOI":"10.1007\/978-3-540-69850-0_7"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Katoen, J., Weininger, M., Winkler, T.: Stochastic games with lexicographic reachability-safety objectives. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020, vol. 12225, pp. 398\u2013420. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_21","DOI":"10.1007\/978-3-030-53291-8_21"},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/S10703-013-0183-7","volume":"43","author":"T Chen","year":"2013","unstructured":"Chen, T., Forejt, V., Kwiatkowska, M.Z., Parker, D., Simaitis, A.: Automatic verification of competitive stochastic systems. Formal Meth. Syst. Des. 43(1), 61\u201392 (2013). https:\/\/doi.org\/10.1007\/S10703-013-0183-7","journal-title":"Formal Meth. Syst. Des."},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Inf. Comput. 96(2), 203\u2013224 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90048-K","journal-title":"Inf. Comput."},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Graham, R.M., Harrison, M.A., Sethi, R. (eds.) POPL 1977, pp. 238\u2013252. ACM (1977). https:\/\/doi.org\/10.1145\/512950.512973","DOI":"10.1145\/512950.512973"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1, 269\u2013271 (1959). https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer. Math."},{"key":"6_CR17","volume-title":"Network Flow Theory","author":"LR Ford","year":"1956","unstructured":"Ford, L.R.: Network Flow Theory. Rand Corporation Paper, Santa Monica (1956)"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/J.TCS.2016.12.003","volume":"735","author":"S Haddad","year":"2018","unstructured":"Haddad, S., Monmege, B.: Interval iteration algorithm for MDPs and IMDPs. Theor. Comput. Sci. 735, 111\u2013131 (2018). https:\/\/doi.org\/10.1016\/J.TCS.2016.12.003","journal-title":"Theor. Comput. Sci."},{"key":"6_CR19","doi-asserted-by":"publisher","unstructured":"Hartmanns, A., Junges, S., Quatmann, T., Weininger, M.: A practitioner\u2019s guide to MDP model checking algorithms. In: Sankaranarayanan, S., Sharygina, N. (eds.) TACAS 2023. vol. 13993, pp. 469\u2013488. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-30823-9_24","DOI":"10.1007\/978-3-031-30823-9_24"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Hartmanns, A., Kaminski, B.L.: Optimistic value iteration. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020. vol. 12225, pp. 488\u2013511. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_26","DOI":"10.1007\/978-3-030-53291-8_26"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Hildmann, H., Saffre, F.: Influence of variable supply and load flexibility on demand-side management. In: EEM 2011, pp. 63\u201368 (2011). https:\/\/doi.org\/10.1109\/EEM.2011.5952980","DOI":"10.1109\/EEM.2011.5952980"},{"issue":"5","key":"6_CR22","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1287\/mnsc.12.5.359","volume":"12","author":"AJ Hoffman","year":"1966","unstructured":"Hoffman, A.J., Karp, R.M.: On nonterminating stochastic games. Manage. Sci. 12(5), 359\u2013370 (1966)","journal-title":"Manage. Sci."},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Kelmendi, E., Kr\u00e4mer, J., Kret\u00ednsk\u00fd, J., Weininger, M.: Value iteration for simple stochastic games: Stopping criterion and learning algorithm. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018, vol. 10981, pp. 623\u2013642. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_36","DOI":"10.1007\/978-3-319-96145-3_36"},{"key":"6_CR24","unstructured":"Knaster, B.: Un theoreme sur les functions d\u2019ensembles. Ann. Soc. Polon. Math. 6, 133\u2013134 (1928). https:\/\/cir.nii.ac.jp\/crid\/1571135651325476992"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Kret\u00ednsk\u00fd, J., Meggendorfer, T., Weininger, M.: Stopping criteria for value iteration on stochastic games with quantitative objectives. In: LICS 2023, pp. 1\u201314. IEEE (2023). https:\/\/doi.org\/10.1109\/LICS56636.2023.10175771","DOI":"10.1109\/LICS56636.2023.10175771"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Kret\u00ednsk\u00fd, J., Ramneantu, E., Slivinskiy, A., Weininger, M.: Comparison of algorithms for simple stochastic games. Inf. Comput. 289(Part), 104885 (2022). https:\/\/doi.org\/10.1016\/J.IC.2022.104885","DOI":"10.1016\/J.IC.2022.104885"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Santos, G.: PRISM-games 3.0: stochastic game verification with concurrency, equilibria and time. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020, vol. 12225, pp. 475\u2013487. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_25","DOI":"10.1007\/978-3-030-53291-8_25"},{"key":"6_CR28","doi-asserted-by":"publisher","unstructured":"McIver, A., Morgan, C.: Results on the quantitative $$\\upmu $$-calculus qM$$\\upmu $$. ACM Trans. Comput. Log. 8(1), 3 (2007). https:\/\/doi.org\/10.1145\/1182613.1182616","DOI":"10.1145\/1182613.1182616"},{"key":"6_CR29","doi-asserted-by":"publisher","unstructured":"Meggendorfer, T.: PET - A partial exploration tool for probabilistic verification. In: Bouajjani, A., Hol\u00edk, L., Wu, Z. (eds.) ATVA 2022, vol. 13505, pp. 320\u2013326. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-19992-9_20","DOI":"10.1007\/978-3-031-19992-9_20"},{"key":"6_CR30","doi-asserted-by":"publisher","unstructured":"Meggendorfer, T.: QComp 2023: Stochastic games - evaluation (2023). https:\/\/doi.org\/10.5281\/zenodo.7831409","DOI":"10.5281\/zenodo.7831409"},{"key":"6_CR31","doi-asserted-by":"publisher","unstructured":"Meggendorfer, T., Weininger, M.: Playing games with your PET: extending the partial exploration tool to stochastic games. In: Gurfinkel, A., Ganesh, V. (eds.) CAV 2024, vol. 14683, pp. 359\u2013372. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-65633-0_16","DOI":"10.1007\/978-3-031-65633-0_16"},{"key":"6_CR32","unstructured":"Park, D.: Fixpoint induction and proofs of program properties. Mach. Intell. 5 (1969). https:\/\/cir.nii.ac.jp\/crid\/1573950399497019904"},{"key":"6_CR33","doi-asserted-by":"publisher","unstructured":"Phalakarn, K., Takisaka, T., Haas, T., Hasuo, I.: Widest paths and global propagation in bounded value iteration for stochastic games. In: Lahiri, S.K., Wang, C. (eds.) CAV 2020, vol. 12225, pp. 349\u2013371. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-53291-8_19","DOI":"10.1007\/978-3-030-53291-8_19"},{"key":"6_CR34","doi-asserted-by":"publisher","unstructured":"Phalakarn, K., Tsai, Y.C., Hasuo, I.: ATVA 2025 artifact: widest path games and maximality inheritance in bounded value iteration for stochastic games (2025). https:\/\/doi.org\/10.5281\/zenodo.15845366","DOI":"10.5281\/zenodo.15845366"},{"key":"6_CR35","doi-asserted-by":"publisher","unstructured":"Quatmann, T., Katoen, J.: Sound value iteration. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018, vol. 10981, pp. 643\u2013661. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_37","DOI":"10.1007\/978-3-319-96145-3_37"},{"key":"6_CR36","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/J.EJCON.2016.04.009","volume":"30","author":"M Svorenov\u00e1","year":"2016","unstructured":"Svorenov\u00e1, M., Kwiatkowska, M.: Quantitative verification and strategy synthesis for stochastic games. Eur. J. Control. 30, 15\u201330 (2016). https:\/\/doi.org\/10.1016\/J.EJCON.2016.04.009","journal-title":"Eur. J. Control."},{"issue":"2","key":"6_CR37","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2140\/pjm.1955.5.285","volume":"5","author":"A Tarski","year":"1955","unstructured":"Tarski, A.: A lattice-theoretical fixpoint theorem and its applications. Pac. J. Math. 5(2), 285\u2013309 (1955)","journal-title":"Pac. J. Math."}],"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-032-08707-2_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T22:33:38Z","timestamp":1761431618000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-08707-2_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,26]]},"ISBN":["9783032087065","9783032087072"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-08707-2_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,26]]},"assertion":[{"value":"26 October 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":"Bengaluru","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conf.researchr.org\/home\/atva-2025","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}