{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:12:48Z","timestamp":1743059568317,"version":"3.40.3"},"publisher-location":"Cham","reference-count":46,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031163357"},{"type":"electronic","value":"9783031163364"}],"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-16336-4_6","type":"book-chapter","created":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T18:02:40Z","timestamp":1662832960000},"page":"107-130","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["POMDP Controllers with\u00a0Optimal Budget"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9113-2791","authenticated-orcid":false,"given":"Jip","family":"Spel","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4587-4970","authenticated-orcid":false,"given":"Svenja","family":"Stein","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6143-1926","authenticated-orcid":false,"given":"Joost-Pieter","family":"Katoen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,11]]},"reference":[{"issue":"3","key":"6_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10458-009-9103-z","volume":"21","author":"C Amato","year":"2010","unstructured":"Amato, C., Bernstein, D.S., Zilberstein, S.: Optimizing fixed-size stochastic controllers for POMDPs and decentralized POMDPs. Auton. Agents Multi Agent Syst. 21(3), 293\u2013320 (2010)","journal-title":"Auton. Agents Multi Agent Syst."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Baier, C., Hensel, C., Hutschenreiter, L., Junges, S., Katoen, J.P., Klein, J.: Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination. Inf. Comput. 272 (2020)","DOI":"10.1016\/j.ic.2019.104504"},{"key":"6_CR3","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"6_CR4","unstructured":"Bonet, B.: Solving large POMDPs using real time dynamic programming. In: Proceedings of the AAAI 2021 Fall Symposium on POMDPs (1998)"},{"key":"6_CR5","unstructured":"Bonet, B., Geffner, H.: Solving POMDPs: RTDP-Bel vs. point-based algorithms. In: IJCAI, pp. 1641\u20131646 (2009)"},{"key":"6_CR6","doi-asserted-by":"publisher","unstructured":"Bork, A., Junges, S., Katoen, J.-P., Quatmann, T.: Verification of Indefinite-Horizon POMDPs. In: Hung, D.V., Sokolsky, O. (eds.) ATVA 2020. LNCS, vol. 12302, pp. 288\u2013304. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59152-6_16","DOI":"10.1007\/978-3-030-59152-6_16"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Bork, A., Katoen, J.-P., Quatmann, T.: Under-approximating expected total rewards in POMDPs. In: TACAS 2022. LNCS, vol. 13244, pp. 22\u201340. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-99527-0_2","DOI":"10.1007\/978-3-030-99527-0_2"},{"key":"6_CR8","unstructured":"Braziunas, D., Boutilier, C.: Stochastic local search for POMDP controllers. In: AAAI, pp. 690\u2013696. AAAI Press\/The MIT Press, Menlo, Park (2004)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Carr, S., Jansen, N., Topcu, U.: Verifiable RNN-based policies for POMDPs under temporal logic constraints. In: IJCAI, pp. 4121\u20134127. ijcai.org (2020)","DOI":"10.24963\/ijcai.2020\/570"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Carr, S., Jansen, N., Wimmer, R., Serban, A.C., Becker, B., Topcu, U.: Counterexample-guided strategy improvement for POMDPs using recurrent neural networks. In: IJCAI, pp. 5532\u20135539. ijcai.org (2019)","DOI":"10.24963\/ijcai.2019\/768"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Chmelik, M., Davies, J.: A symbolic SAT-based algorithm for almost-sure reachability with small strategies in POMDPs. In: AAAI. pp. 3225\u20133232. AAAI Press, Menlo, Park (2016)","DOI":"10.1609\/aaai.v30i1.10422"},{"key":"6_CR12","doi-asserted-by":"publisher","unstructured":"Chen, T., Feng, Y., Rosenblum, D.S., Su, G.: Perturbation analysis in verification of discrete-time Markov chains. In: Baldan, P., Gorla, D. (eds.) CONCUR 2014. LNCS, vol. 8704, pp. 218\u2013233. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44584-6_16","DOI":"10.1007\/978-3-662-44584-6_16"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Cleaveland, M., Ruchkin, I., Sokolsky, O., Lee, I.: Monotonic safety for scalable and data-efficient probabilistic safety analysis. In: ICCPS, pp. 92\u2013103. ACM (2022)","DOI":"10.1109\/ICCPS54341.2022.00015"},{"key":"6_CR14","doi-asserted-by":"publisher","unstructured":"Daws, C.: Symbolic and parametric model checking of discrete-time Markov chains. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 280\u2013294. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31862-0_21","DOI":"10.1007\/978-3-540-31862-0_21"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Doshi, F., Pineau, J., Roy, N.: Reinforcement learning with limited reinforcement: using Bayes risk for active learning in POMDPs. In: ICML. ACM International Conference Proceeding Series, vol. 307, pp. 256\u2013263. ACM (2008)","DOI":"10.1145\/1390156.1390189"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Fang, X., Calinescu, R., Gerasimou, S., Alhwikem, F.: Fast parametric model checking through model fragmentation. In: ICSE. pp. 835\u2013846. IEEE (2021)","DOI":"10.1109\/ICSE43902.2021.00081"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Filieri, A., Ghezzi, C., Tamburrelli, G.: Run-time efficient probabilistic model checking. In: ICSE. ACM (2011)","DOI":"10.1145\/1985793.1985840"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Gainer, P., Hahn, E.M., Schewe, S.: Accelerated model checking of parametric Markov chains. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 300\u2013316. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_18","DOI":"10.1007\/978-3-030-01090-4_18"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Gouberman, A., Siegle, M., Tati, B.: Markov chains with perturbed rates to absorption: theory and application to model repair. Perform. Eval. 130, 32\u201350 (2019)","DOI":"10.1016\/j.peva.2018.11.006"},{"key":"6_CR20","doi-asserted-by":"publisher","unstructured":"Hahn, E.M., Han, T., Zhang, L.: Synthesis for PCTL in parametric Markov decision processes. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol. 6617, pp. 146\u2013161. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20398-5_12","DOI":"10.1007\/978-3-642-20398-5_12"},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Hahn, E.M., Hermanns, H., Zhang, L.: Probabilistic reachability for parametric Markov models. Int. J. Softw. Tools Technol. Transfer 13, 319 (2011). https:\/\/doi.org\/10.1007\/s10009-010-0146-x","DOI":"10.1007\/s10009-010-0146-x"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Hartmanns, A., Klauck, M., Parker, D., Quatmann, T., Ruijters, E.: The quantitative verification benchmark set. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11427, pp. 344\u2013350. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_20","DOI":"10.1007\/978-3-030-17462-0_20"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Hauskrecht, M.: Value-function approximations for partially observable Markov decision processes. J. Artif. Intell. Res. 13, 33\u201394 (2000)","DOI":"10.1613\/jair.678"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Hensel, C., Junges, S., Katoen, J.-P., Quatmann, T., Volk, M.: The probabilistic model checker Storm. Int. J. Softw. Tools Technol. Transfer 1\u201322 (2021). https:\/\/doi.org\/10.1007\/s10009-021-00633-z","DOI":"10.1007\/s10009-021-00633-z"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Hutschenreiter, L., Baier, C., Klein, J.: Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination. In: GandALF. EPTCS, vol. 256 (2017)","DOI":"10.4204\/EPTCS.256.2"},{"key":"6_CR26","doi-asserted-by":"publisher","unstructured":"Jansen, N., Corzilius, F., Volk, M., Wimmer, R., \u00c1brah\u00e1m, E., Katoen, J.-P., Becker, B.: Accelerating parametric probabilistic verification. In: Norman, G., Sanders, W. (eds.) QEST 2014. LNCS, vol. 8657, pp. 404\u2013420. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10696-0_31","DOI":"10.1007\/978-3-319-10696-0_31"},{"key":"6_CR27","unstructured":"Junges, S.: Parameter synthesis in Markov models. Ph.D. thesis, RWTH Aachen University, Germany (2020)"},{"key":"6_CR28","unstructured":"Junges, S., et al.: Parameter synthesis for Markov models. CoRR abs\/1903.07993 (2019)"},{"key":"6_CR29","unstructured":"Junges, S., et al.: Finite-state controllers of POMDPs using parameter synthesis. In: UAI. AUAI Press, Monterey,(2018)"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Kaelbling, L.P., Littman, M.L., Cassandra, A.R.: Planning and acting in partially observable stochastic domains. Artif. Intell. 101(1\u20132), 99\u2013134 (1998)","DOI":"10.1016\/S0004-3702(98)00023-X"},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Lanotte, R., Maggiolo-Schettini, A., Troina, A.: Parametric probabilistic transition systems for system design and analysis. Formal Aspects Comput. 19(1), 93\u2013109 (2007)","DOI":"10.1007\/s00165-006-0015-2"},{"key":"6_CR32","doi-asserted-by":"crossref","unstructured":"Littman, M.L., Cassandra, A.R., Kaelbling, L.P.: Learning policies for partially observable environments: Scaling up. In: ICML, pp. 362\u2013370. Morgan Kaufmann (1995)","DOI":"10.1016\/B978-1-55860-377-6.50052-9"},{"key":"6_CR33","doi-asserted-by":"crossref","unstructured":"Lovejoy, W.S.: Computationally feasible bounds for partially observed Markov decision processes. Oper. Res. 39(1), 162\u2013175, 104504 (1991)","DOI":"10.1287\/opre.39.1.162"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Pathak, S., \u00c1brah\u00e1m, E., Jansen, N., Tacchella, A., Katoen, J.P.: A greedy approach for the efficient repair of stochastic models. In: NFM. LNCS, vol. 9058 (2015)","DOI":"10.1007\/978-3-319-17524-9_21"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-46520-3_4","volume-title":"Automated Technology for Verification and Analysis","author":"T Quatmann","year":"2016","unstructured":"Quatmann, T., Dehnert, C., Jansen, N., Junges, S., Katoen, J.-P.: Parameter synthesis for Markov models: faster than ever. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 50\u201367. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46520-3_4"},{"key":"6_CR36","unstructured":"Russell, S., Norvig, P.: Artificial Intelligence: A Modern Approach, 4th edn. Pearson, Boston (2020)"},{"key":"6_CR37","unstructured":"Silver, D., Veness, J.: Monte-Carlo planning in large POMDPs. In: NIPS, pp. 2164\u20132172. Curran Associates, Inc., Red Hook (2010)"},{"key":"6_CR38","unstructured":"Smith, T., Simmons, R.G.: Heuristic Search Value Iteration for POMDPs. In: UAI. pp. 520\u2013527. AUAI Press (2004)"},{"key":"6_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-030-31784-3_28","volume-title":"Automated Technology for Verification and Analysis","author":"J Spel","year":"2019","unstructured":"Spel, J., Junges, S., Katoen, J.-P.: Are parametric Markov chains monotonic? In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 479\u2013496. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_28"},{"key":"6_CR40","doi-asserted-by":"crossref","unstructured":"Spel, J., Junges, S., Katoen, J.P.: Are parametric Markov chains monotonic? CoRR abs\/1907.08491 (2019), extended version","DOI":"10.1007\/978-3-030-31784-3_28"},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-030-72016-2_10","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Spel","year":"2021","unstructured":"Spel, J., Junges, S., Katoen, J.-P.: Finding provably optimal Markov chains. In: TACAS 2021. LNCS, vol. 12651, pp. 173\u2013190. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-72016-2_10"},{"key":"6_CR42","doi-asserted-by":"publisher","unstructured":"Spel, J., Stein, S., Katoen, J.P.: POMDP controllers with optimal budget (artifact). Zenodo , 104504 (2022). https:\/\/doi.org\/10.5281\/zenodo.6793377","DOI":"10.5281\/zenodo.6793377"},{"key":"6_CR43","unstructured":"Wang, Y., Chaudhuri, S., Kavraki, L.E.: Bounded policy synthesis for POMDPs with safe-reachability objectives. In: International Foundation for Autonomous Agents and Multiagent Systems Richland, AAMAS, pp. 238\u2013246. SC, USA\/ACM (2018)"},{"key":"6_CR44","unstructured":"Winkler, T., Junges, S., P\u00e9rez, G.A., Katoen, J.: On the complexity of reachability in parametric Markov decision processes. In: Proceedings of CONCUR. LIPIcs, vol. 140, pp. 14:1\u201314:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019)"},{"key":"6_CR45","doi-asserted-by":"crossref","unstructured":"Winterer, L., et al.: Motion planning under partial observability using game-based abstraction. In: CDC, pp. 2201\u20132208. IEEE (2017)","DOI":"10.1109\/CDC.2017.8263971"},{"key":"6_CR46","doi-asserted-by":"crossref","unstructured":"Yang, L., Murugesan, S., Zhang, J.: Real-time scheduling over Markovian channels: when partial observability meets hard deadlines. In: GLOBECOM, pp. 1\u20135. IEEE (2011)","DOI":"10.1109\/GLOCOM.2011.6133855"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16336-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T16:48:39Z","timestamp":1727974119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16336-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031163357","9783031163364"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16336-4_6","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":"11 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of 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":"16 September 2022","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":"qest2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.qest.org\/qest2022\/","order":11,"name":"conference_url","label":"Conference URL","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":"44","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":"19","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":"1","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":"43% - 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-4","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)"}}]}}