{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:28:09Z","timestamp":1762291689664,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032095237","type":"print"},{"value":"9783032095244","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"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-09524-4_12","type":"book-chapter","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:13:59Z","timestamp":1762290839000},"page":"171-185","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compositional Verification of\u00a0Almost-Sure B\u00fcchi\u00a0Objectives\u00a0in\u00a0MDPs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2451-5466","authenticated-orcid":false,"given":"Marck","family":"van der Vegt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4167-3370","authenticated-orcid":false,"given":"Kazuki","family":"Watanabe","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"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0978-8466","authenticated-orcid":false,"given":"Sebastian","family":"Junges","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,5]]},"reference":[{"key":"12_CR1","unstructured":"Andriushchenko, R., et al.: Tools at the frontiers of quantitative verification. CoRR, abs\/2405.13583 (2024)"},{"key":"12_CR2","unstructured":"Baier, C., Katoen, J.-P.: Principles of model checking. MIT Press (2008)"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Chatterjee , K., Henzinger, M.: Faster and dynamic algorithms for maximal end-component decomposition and related graph problems in probabilistic verification. In: SODA, pp. 1318\u20131336. SIAM (2011)","DOI":"10.1137\/1.9781611973082.101"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Jurdzi\u0144ski, M., Henzinger, T.A.: Simple stochastic parity games. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 100\u2013113. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45220-1_11","DOI":"10.1007\/978-3-540-45220-1_11"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Long, D.E., McMillan, K.L.: Compositional model checking. In: LICS, pp. 353\u2013362. IEEE Computer Society (1989)","DOI":"10.1109\/LICS.1989.39190"},{"key":"12_CR6","unstructured":"de\u00a0Alfaro, L.: Formal verification of probabilistic systems. PhD thesis, Stanford University, USA (1997)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"de\u00a0Alfaro, L., Henzinger, T.A.: Concurrent omega-regular games. In: LICS, pp. 141\u2013154. IEEE Computer Society (2000)","DOI":"10.1109\/LICS.2000.855763"},{"key":"12_CR8","unstructured":"Delgrange, F., Avni, G., Lukina, A., Schilling, G., Now\u00e9, A., P\u00e9rez, G.A.: Composing reinforcement learning policies, with formal guarantees. In: AAMAS, pp. 574\u2013583. International Foundation for Autonomous Agents and Multiagent Systems\/ACM (2025)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Feng, L., Kwiatkowska, M.Z., Parker, D.: Compositional verification of probabilistic systems using learning. In: QEST, pp. 133\u2013142. IEEE Computer Society (2010)","DOI":"10.1109\/QEST.2010.24"},{"key":"12_CR10","doi-asserted-by":"publisher","unstructured":"Feng, L., Kwiatkowska, M., Parker, D.: Automated learning of probabilistic assumptions for compositional reasoning. In: Giannakopoulou, D., Orejas, F. (eds.) FASE 2011. LNCS, vol. 6603, pp. 2\u201317. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19811-3_2","DOI":"10.1007\/978-3-642-19811-3_2"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Forejt, V., Kwiatkowska, M., Norman, G., Parker, D.: Automated verification techniques for probabilistic systems. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol. 6659, pp. 53\u2013113. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21455-4_3","DOI":"10.1007\/978-3-642-21455-4_3"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Hartmanns, A., Junges, S., Quatmann, T., Weininger, M.: A practitioner\u2019s guide to MDP model checking algorithms. In: TACAS (1), vol. 13993. LNCS, pp. 469\u2013488. Springer (2023)","DOI":"10.1007\/978-3-031-30823-9_24"},{"key":"12_CR13","unstructured":"Hauskrecht, M., Meuleau, N., Kaelbling, L.P., Dean, T.L., Boutilier, C.: Hierarchical solution of Markov decision processes using macro-actions. In: UAI, pp. 220\u2013229. Morgan Kaufmann (1998)"},{"key":"12_CR14","unstructured":"Jothimurugan, K., Bansal, S., Bastani, O., Alur, R.: Compositional reinforcement learning from logical specifications. In: NeurIPS, pp. 10026\u201310039 (2021)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Junges, S., Spaan, M.T.J.: Abstraction-refinement for hierarchical probabilistic models. In: CAV (1), vol. 13371. LNCS, pp. 102\u2013123. Springer (2022)","DOI":"10.1007\/978-3-031-13185-1_6"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Neary, C., Verginis, C.K., Cubuktepe, M., Topcu, U.: Verifiable and compositional reinforcement learning systems. In: ICAPS, pp. 615\u2013623. AAAI Press (2022)","DOI":"10.1609\/icaps.v32i1.19849"},{"key":"12_CR17","unstructured":"van\u00a0der Vegt, M., Watanabe, K., Hasuo, I., Junges, S.: Compositional verification of almost-sure B\u00fcchi objectives in MDPs. CoRR, abs\/2508.13087 (2025)"},{"key":"12_CR18","unstructured":"Watanabe, K.: Pareto fronts for compositionally solving string diagrams of parity games. In: CALCO, vol. 342. LIPIcs, pp. 14:1\u201314:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2025)"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Watanabe, K., Eberhart, C., Asada, K., Hasuo, I.: A compositional approach to parity games. In: MFPS, vol. 351. EPTCS, pp. 278\u2013295 (2021)","DOI":"10.4204\/EPTCS.351.17"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Watanabe, K., Eberhart, C., Asada, K., Hasuo, I.: Compositional probabilistic model checking with string diagrams of MDPs. In: CAV (3), vol. 13966. LNCS, pp. 40\u201361. Springer (2023)","DOI":"10.1007\/978-3-031-37709-9_3"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Watanabe, K., Eberhart, C., Asada, K., Hasuo, I.: Compositional solution of mean payoff games by string diagrams. In: Principles of Verification (3), vol. 15262. LNCS, pp. 423\u2013445. Springer (2024)","DOI":"10.1007\/978-3-031-75778-5_20"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Watanabe, K., van\u00a0der Vegt, M., Hasuo, I., Rot, J., Junges, S.: Pareto curves for compositionally model checking string diagrams of MDPs. In: TACAS (2), vol. 14571. LNCS, pp. 279\u2013298. Springer (2024)","DOI":"10.1007\/978-3-031-57249-4_14"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Watanabe, K., van\u00a0der Vegt, M., Junges, S., Hasuo, I.: Compositional value iteration with Pareto caching. In: CAV (3), vol. 14683. LNCS, pp. 467\u2013491. Springer (2024)","DOI":"10.1007\/978-3-031-65633-0_21"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09524-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:01Z","timestamp":1762290841000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09524-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"ISBN":["9783032095237","9783032095244"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09524-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,5]]},"assertion":[{"value":"5 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp25.software.imdea.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}