{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:15:15Z","timestamp":1760202915036,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"RTG","award":["2236 UnRAVeL"],"award-info":[{"award-number":["2236 UnRAVeL"]}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["KR 4890\/2-1 Statistical Unbounded Verification"],"award-info":[{"award-number":["KR 4890\/2-1 Statistical Unbounded Verification"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001821","name":"Vienna Science and Technology Fund","doi-asserted-by":"publisher","award":["Project ICT15-003"],"award-info":[{"award-number":["Project ICT15-003"]}],"id":[{"id":"10.13039\/501100001821","id-type":"DOI","asserted-by":"publisher"}]},{"name":"TUM IGSSE","award":["10.06 PARSEC"],"award-info":[{"award-number":["10.06 PARSEC"]}]},{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["CoG 863818 (ForM-SMArt)"],"award-info":[{"award-number":["CoG 863818 (ForM-SMArt)"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394761","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"102-115","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Approximating Values of Generalized-Reachability Stochastic Games"],"prefix":"10.1145","author":[{"given":"Pranav","family":"Ashok","sequence":"first","affiliation":[{"name":"Technical University of Munich, Germany"}]},{"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[{"name":"IST Austria, Austria"}]},{"given":"Jan","family":"K\u0159et\u00ednsk\u00fd","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Germany"}]},{"given":"Maximilian","family":"Weininger","sequence":"additional","affiliation":[{"name":"Technical University of Munich, Germany"}]},{"given":"Tobias","family":"Winkler","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Germany"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Pranav Ashok Krishnendu Chatterjee Przemyslaw Daca Jan Kret\u00ednsk\u00fd and Tobias Meggendorfer. 2017. Value Iteration for Long-Run Average Reward in Markov Decision Processes. In CAV. 201--221. https:\/\/doi.org\/10.1007\/978-3-319-63387-9_10  Pranav Ashok Krishnendu Chatterjee Przemyslaw Daca Jan Kret\u00ednsk\u00fd and Tobias Meggendorfer. 2017. Value Iteration for Long-Run Average Reward in Markov Decision Processes. In CAV. 201--221. https:\/\/doi.org\/10.1007\/978-3-319-63387-9_10","DOI":"10.1007\/978-3-319-63387-9_10"},{"key":"e_1_3_2_1_3_1","volume-title":"Approximating Values of Generalized-Reachability Stochastic Games. CoRR abs\/1908.05106","author":"Ashok Pranav","year":"2020","unstructured":"Pranav Ashok , Krishnendu Chatterjee , Jan Kretinsky , Maximilian Weininger , and Tobias Winkler . 2020. Approximating Values of Generalized-Reachability Stochastic Games. CoRR abs\/1908.05106 ( 2020 ). Pranav Ashok, Krishnendu Chatterjee, Jan Kretinsky, Maximilian Weininger, and Tobias Winkler. 2020. Approximating Values of Generalized-Reachability Stochastic Games. CoRR abs\/1908.05106 (2020)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Christel Baier Marcus Daum Clemens Dubslaff Joachim Klein and Sascha Kl\u00fcppelholz. 2014. Energy-Utility Quantiles. In NASA Formal Methods. 285--299.  Christel Baier Marcus Daum Clemens Dubslaff Joachim Klein and Sascha Kl\u00fcppelholz. 2014. Energy-Utility Quantiles. In NASA Formal Methods. 285--299.","DOI":"10.1007\/978-3-319-06200-6_24"},{"key":"e_1_3_2_1_5_1","first-page":"1","article-title":"Tradeoff analysis meets probabilistic model checking","volume":"1","author":"Baier Christel","year":"2014","unstructured":"Christel Baier , Clemens Dubslaff , and Sascha Kl\u00fcppelholz . 2014 . Tradeoff analysis meets probabilistic model checking . In CSL-LICS. 1 : 1 -- 1 :10. Christel Baier, Clemens Dubslaff, and Sascha Kl\u00fcppelholz. 2014. Tradeoff analysis meets probabilistic model checking. In CSL-LICS. 1:1--1:10.","journal-title":"CSL-LICS."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Christel Baier Clemens Dubslaff Sascha Kl\u00fcppelholz Marcus Daum Joachim Klein Steffen M\u00e4rcker and Sascha Wunderlich. 2014. Probabilistic Model Checking and Non-standard Multi-objective Reasoning. In FASE. 1--16.  Christel Baier Clemens Dubslaff Sascha Kl\u00fcppelholz Marcus Daum Joachim Klein Steffen M\u00e4rcker and Sascha Wunderlich. 2014. Probabilistic Model Checking and Non-standard Multi-objective Reasoning. In FASE. 1--16.","DOI":"10.1007\/978-3-642-54804-8_1"},{"key":"e_1_3_2_1_7_1","unstructured":"Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking.  Christel Baier and Joost-Pieter Katoen. 2008. Principles of Model Checking."},{"volume-title":"TACAS (Lecture Notes in Computer Science)","author":"Basset Nicolas","key":"e_1_3_2_1_8_1","unstructured":"Nicolas Basset , Marta Z. Kwiatkowska , Ufuk Topcu , and Clemens Wiltsche . 2015. Strategy Synthesis for Stochastic Games with Multiple Long-Run Objectives . In TACAS (Lecture Notes in Computer Science) , Vol. 9035 . Springer , 256--271. Nicolas Basset, Marta Z. Kwiatkowska, Ufuk Topcu, and Clemens Wiltsche. 2015. Strategy Synthesis for Stochastic Games with Multiple Long-Run Objectives. In TACAS (Lecture Notes in Computer Science), Vol. 9035. Springer, 256--271."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Nicolas Basset Marta Z. Kwiatkowska and Clemens Wiltsche. 2018. Compositional strategy synthesis for stochastic games with multiple objectives. Inf. Comput. 261 Part (2018) 536--587.  Nicolas Basset Marta Z. Kwiatkowska and Clemens Wiltsche. 2018. Compositional strategy synthesis for stochastic games with multiple objectives. Inf. Comput. 261 Part (2018) 536--587.","DOI":"10.1016\/j.ic.2017.09.010"},{"key":"e_1_3_2_1_10_1","volume-title":"Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. LMCS 10, 1","author":"Br\u00e1zdil Tom\u00e1s","year":"2014","unstructured":"Tom\u00e1s Br\u00e1zdil , V\u00e1clav Brozek , Krishnendu Chatterjee , Vojtech Forejt , and Anton\u00edn Kucera . 2014. Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. LMCS 10, 1 ( 2014 ). https:\/\/doi.org\/10.2168\/LMCS-10(1:13)2014 Tom\u00e1s Br\u00e1zdil, V\u00e1clav Brozek, Krishnendu Chatterjee, Vojtech Forejt, and Anton\u00edn Kucera. 2014. Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. LMCS 10, 1 (2014). https:\/\/doi.org\/10.2168\/LMCS-10(1:13)2014"},{"volume-title":"ATVA (Lecture Notes in Computer Science)","author":"Br\u00e1zdil Tom\u00e1s","key":"e_1_3_2_1_11_1","unstructured":"Tom\u00e1s Br\u00e1zdil , Krishnendu Chatterjee , Martin Chmelik , Vojtech Forejt , Jan Kret\u00ednsk\u00fd , Marta Z. Kwiatkowska , David Parker , and Mateusz Ujma . 2014. Verification of Markov Decision Processes Using Learning Algorithms . In ATVA (Lecture Notes in Computer Science) , Vol. 8837 . Springer , 98--114. Tom\u00e1s Br\u00e1zdil, Krishnendu Chatterjee, Martin Chmelik, Vojtech Forejt, Jan Kret\u00ednsk\u00fd, Marta Z. Kwiatkowska, David Parker, and Mateusz Ujma. 2014. Verification of Markov Decision Processes Using Learning Algorithms. In ATVA (Lecture Notes in Computer Science), Vol. 8837. Springer, 98--114."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Tom\u00e1s Br\u00e1zdil Krishnendu Chatterjee Vojtech Forejt and Anton\u00edn Kucera. 2013. Trading Performance for Stability in Markov Decision Processes. In LICS. 331--340.  Tom\u00e1s Br\u00e1zdil Krishnendu Chatterjee Vojtech Forejt and Anton\u00edn Kucera. 2013. Trading Performance for Stability in Markov Decision Processes. In LICS. 331--340.","DOI":"10.1109\/LICS.2013.39"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46520-3_15"},{"volume-title":"CAV (2) (Lecture Notes in Computer Science)","author":"Brenguier Romain","key":"e_1_3_2_1_14_1","unstructured":"Romain Brenguier and Jean-Fran\u00e7ois Raskin . 2015. Pareto Curves of Multidimensional Mean-Payoff Games . In CAV (2) (Lecture Notes in Computer Science) , Vol. 9207 . Springer , 251--267. Romain Brenguier and Jean-Fran\u00e7ois Raskin. 2015. Pareto Curves of Multidimensional Mean-Payoff Games. In CAV (2) (Lecture Notes in Computer Science), Vol. 9207. Springer, 251--267."},{"volume-title":"FSTTCS (Lecture Notes in Computer Science)","author":"Chatterjee Krishnendu","key":"e_1_3_2_1_15_1","unstructured":"Krishnendu Chatterjee . 2007. Markov Decision Processes with Multiple Long-Run Average Objectives . In FSTTCS (Lecture Notes in Computer Science) , Vol. 4855 . Springer , 473--484. Krishnendu Chatterjee. 2007. Markov Decision Processes with Multiple Long-Run Average Objectives. In FSTTCS (Lecture Notes in Computer Science), Vol. 4855. Springer, 473--484."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Krishnendu Chatterjee and Laurent Doyen. 2016. Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. In LICS. ACM 247--256.  Krishnendu Chatterjee and Laurent Doyen. 2016. Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. In LICS. ACM 247--256.","DOI":"10.1145\/2933575.2934513"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Krishnendu Chatterjee and Nathana\u00ebl Fijalkow. 2011. A reduction from parity games to simple stochastic games. In GandALF. 74--86. https:\/\/doi.org\/10.4204\/EPTCS.54.6  Krishnendu Chatterjee and Nathana\u00ebl Fijalkow. 2011. A reduction from parity games to simple stochastic games. In GandALF. 74--86. https:\/\/doi.org\/10.4204\/EPTCS.54.6","DOI":"10.4204\/EPTCS.54.6"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Krishnendu Chatterjee Vojtech Forejt and Dominik Wojtczak. 2013. Multi-objective Discounted Reward Verification in Graphs and MDPs. In LPAR. 228--242.  Krishnendu Chatterjee Vojtech Forejt and Dominik Wojtczak. 2013. Multi-objective Discounted Reward Verification in Graphs and MDPs. In LPAR. 228--242.","DOI":"10.1007\/978-3-642-45221-5_17"},{"volume-title":"Value iteration. In 25 Years of Model Checking","author":"Chatterjee Krishnendu","key":"e_1_3_2_1_19_1","unstructured":"Krishnendu Chatterjee and Thomas A Henzinger . 2008. Value iteration. In 25 Years of Model Checking . Springer , 107--138. Krishnendu Chatterjee and Thomas A Henzinger. 2008. Value iteration. In 25 Years of Model Checking. Springer, 107--138."},{"key":"e_1_3_2_1_20_1","volume-title":"Gist: A Solver for Probabilistic Games. In CAV. 665--669. https:\/\/doi.org\/10.1007\/978-3-642-14295-6_57","author":"Chatterjee Krishnendu","year":"2010","unstructured":"Krishnendu Chatterjee , Thomas A. Henzinger , Barbara Jobstmann , and Arjun Radhakrishna . 2010 . Gist: A Solver for Probabilistic Games. In CAV. 665--669. https:\/\/doi.org\/10.1007\/978-3-642-14295-6_57 Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, and Arjun Radhakrishna. 2010. Gist: A Solver for Probabilistic Games. In CAV. 665--669. https:\/\/doi.org\/10.1007\/978-3-642-14295-6_57"},{"key":"e_1_3_2_1_21_1","volume-title":"Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. Logical Methods in Computer Science 13, 2","author":"Chatterjee Krishnendu","year":"2017","unstructured":"Krishnendu Chatterjee , Zuzana Kret\u00ednsk\u00e1 , and Jan Kret\u00ednsk\u00fd . 2017. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. Logical Methods in Computer Science 13, 2 ( 2017 ). Krishnendu Chatterjee, Zuzana Kret\u00ednsk\u00e1, and Jan Kret\u00ednsk\u00fd. 2017. Unifying Two Views on Multiple Mean-Payoff Objectives in Markov Decision Processes. Logical Methods in Computer Science 13, 2 (2017)."},{"volume-title":"TACAS (Lecture Notes in Computer Science)","author":"Chen Taolue","key":"e_1_3_2_1_22_1","unstructured":"Taolue Chen , Vojtech Forejt , Marta Z. Kwiatkowska , David Parker , and Aistis Simaitis . 2013. PRISM-games: A Model Checker for Stochastic Multi-Player Games . In TACAS (Lecture Notes in Computer Science) , Vol. 7795 . Springer , 185--191. Taolue Chen, Vojtech Forejt, Marta Z. Kwiatkowska, David Parker, and Aistis Simaitis. 2013. PRISM-games: A Model Checker for Stochastic Multi-Player Games. In TACAS (Lecture Notes in Computer Science), Vol. 7795. Springer, 185--191."},{"volume-title":"MFCS (Lecture Notes in Computer Science)","author":"Chen Taolue","key":"e_1_3_2_1_23_1","unstructured":"Taolue Chen , Vojtech Forejt , Marta Z. Kwiatkowska , Aistis Simaitis , and Clemens Wiltsche . 2013. On Stochastic Games with Multiple Objectives . In MFCS (Lecture Notes in Computer Science) , Vol. 8087 . Springer , 266--277. Taolue Chen, Vojtech Forejt, Marta Z. Kwiatkowska, Aistis Simaitis, and Clemens Wiltsche. 2013. On Stochastic Games with Multiple Objectives. In MFCS (Lecture Notes in Computer Science), Vol. 8087. Springer, 266--277."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Taolue Chen Marta Z. Kwiatkowska Aistis Simaitis and Clemens Wiltsche. 2013. Synthesis for Multi-objective Stochastic Games: An Application to Autonomous Urban Driving. In QEST. 322--337. https:\/\/doi.org\/10.1007\/978-3-642-40196-1_28  Taolue Chen Marta Z. Kwiatkowska Aistis Simaitis and Clemens Wiltsche. 2013. Synthesis for Multi-objective Stochastic Games: An Application to Autonomous Urban Driving. In QEST. 322--337. https:\/\/doi.org\/10.1007\/978-3-642-40196-1_28","DOI":"10.1007\/978-3-642-40196-1_28"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Chih-Hong Cheng Alois Knoll Michael Luttenberger and Christian Buckl. 2011. GAVS+: An Open Platform for the Research of Algorithmic Game Solving. In ETAPS. 258--261. https:\/\/doi.org\/10.1007\/978-3-642-19835-9_22  Chih-Hong Cheng Alois Knoll Michael Luttenberger and Christian Buckl. 2011. GAVS+: An Open Platform for the Research of Algorithmic Game Solving. In ETAPS. 258--261. https:\/\/doi.org\/10.1007\/978-3-642-19835-9_22","DOI":"10.1007\/978-3-642-19835-9_22"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90048-K"},{"key":"e_1_3_2_1_28_1","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume-title":"Advances in Computational Complexity Theory","author":"Condon Anne","unstructured":"Anne Condon . 1993. On Algorithms for Simple Stochastic Games . In Advances in Computational Complexity Theory , volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science . American Mathematical Society , 51--73. Anne Condon. 1993. On Algorithms for Simple Stochastic Games. In Advances in Computational Complexity Theory, volume 13 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 51--73."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/210332.210339"},{"key":"e_1_3_2_1_30_1","volume-title":"Multi-Objective Model Checking of Markov Decision Processes. Logical Methods in Computer Science 4, 4","author":"Etessami Kousha","year":"2008","unstructured":"Kousha Etessami , Marta Z. Kwiatkowska , Moshe Y. Vardi , and Mihalis Yannakakis . 2008. Multi-Objective Model Checking of Markov Decision Processes. Logical Methods in Computer Science 4, 4 ( 2008 ). Kousha Etessami, Marta Z. Kwiatkowska, Moshe Y. Vardi, and Mihalis Yannakakis. 2008. Multi-Objective Model Checking of Markov Decision Processes. Logical Methods in Computer Science 4, 4 (2008)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/9.362904"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"crossref","unstructured":"Vojtech Forejt Marta Z. Kwiatkowska Gethin Norman David Parker and Hongyang Qu. 2011. Quantitative Multi-objective Verification for Probabilistic Systems. In TACAS. 112--127. https:\/\/doi.org\/10.1007\/978-3-642-19835-9_11  Vojtech Forejt Marta Z. Kwiatkowska Gethin Norman David Parker and Hongyang Qu. 2011. Quantitative Multi-objective Verification for Probabilistic Systems. In TACAS. 112--127. https:\/\/doi.org\/10.1007\/978-3-642-19835-9_11","DOI":"10.1007\/978-3-642-19835-9_11"},{"volume-title":"ATVA (Lecture Notes in Computer Science)","author":"Forejt Vojtech","key":"e_1_3_2_1_33_1","unstructured":"Vojtech Forejt , Marta Z. Kwiatkowska , and David Parker . 2012. Pareto Curves for Probabilistic Model Checking . In ATVA (Lecture Notes in Computer Science) , Vol. 7561 . Springer , 317--332. Vojtech Forejt, Marta Z. Kwiatkowska, and David Parker. 2012. Pareto Curves for Probabilistic Model Checking. In ATVA (Lecture Notes in Computer Science), Vol. 7561. Springer, 317--332."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Christoph Haase Stefan Kiefer and Markus Lohrey. 2017. Computing quantiles in Markov chains with multi-dimensional costs. In LICS. 1--12.  Christoph Haase Stefan Kiefer and Markus Lohrey. 2017. Computing quantiles in Markov chains with multi-dimensional costs. In LICS. 1--12.","DOI":"10.1109\/LICS.2017.8005090"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.12.003"},{"key":"e_1_3_2_1_36_1","unstructured":"A. Hatcher. 2002. Algebraic Topology. Cambridge University Press. https:\/\/books.google.de\/books?id=BjKs86kosqgC  A. Hatcher. 2002. Algebraic Topology. Cambridge University Press. https:\/\/books.google.de\/books?id=BjKs86kosqgC"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Edon Kelmendi Julia Kr\u00e4mer Jan Kret\u00ednsk\u00fd and Maximilian Weininger. 2018. Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm. In CAV. https:\/\/doi.org\/10.1007\/978-3-319-96145-3_36  Edon Kelmendi Julia Kr\u00e4mer Jan Kret\u00ednsk\u00fd and Maximilian Weininger. 2018. Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm. In CAV. https:\/\/doi.org\/10.1007\/978-3-319-96145-3_36","DOI":"10.1007\/978-3-319-96145-3_36"},{"volume-title":"TACAS (Lecture Notes in Computer Science)","author":"Kwiatkowska Marta","key":"e_1_3_2_1_38_1","unstructured":"Marta Kwiatkowska , David Parker , and Clemens Wiltsche . 2016. PRISM- Games 2.0 : A Tool for Multi-objective Strategy Synthesis for Stochastic Games . In TACAS (Lecture Notes in Computer Science) , Vol. 9636 . Springer , 560--566. Marta Kwiatkowska, David Parker, and Clemens Wiltsche. 2016. PRISM-Games 2.0: A Tool for Multi-objective Strategy Synthesis for Stochastic Games. In TACAS (Lecture Notes in Computer Science), Vol. 9636. Springer, 560--566."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-017-0476-z"},{"volume-title":"CAV (Lecture Notes in Computer Science)","author":"Kwiatkowska Marta Z.","key":"e_1_3_2_1_40_1","unstructured":"Marta Z. Kwiatkowska , Gethin Norman , and David Parker . 2011. PRISM 4.0 : Verification of Probabilistic Real-Time Systems . In CAV (Lecture Notes in Computer Science) , Vol. 6806 . Springer , 585--591. Marta Z. Kwiatkowska, Gethin Norman, and David Parker. 2011. PRISM 4.0: Verification of Probabilistic Real-Time Systems. In CAV (Lecture Notes in Computer Science), Vol. 6806. Springer, 585--591."},{"key":"e_1_3_2_1_41_1","volume-title":"Gordon","author":"Mcmahan H. Brendan","year":"2005","unstructured":"H. Brendan Mcmahan , Maxim Likhachev , and Geoffrey J . Gordon . 2005 . Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. In ICML 05. 569--576. H. Brendan Mcmahan, Maxim Likhachev, and Geoffrey J. Gordon. 2005. Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. In ICML 05. 569--576."},{"key":"e_1_3_2_1_42_1","volume-title":"Papadimitriou and Mihalis Yannakakis","author":"Christos","year":"2000","unstructured":"Christos H. Papadimitriou and Mihalis Yannakakis . 2000 . On the Approximability of Trade-offs and Optimal Access of Web Sources. In FOCS. IEEE Computer Society , 86--92. Christos H. Papadimitriou and Mihalis Yannakakis. 2000. On the Approximability of Trade-offs and Optimal Access of Web Sources. In FOCS. IEEE Computer Society, 86--92."},{"volume-title":"Markov decision processes: Discrete stochastic dynamic programming","author":"Puterman Martin L.","key":"e_1_3_2_1_43_1","unstructured":"Martin L. Puterman . 2014. Markov decision processes: Discrete stochastic dynamic programming . John Wiley & Sons . Martin L. Puterman. 2014. Markov decision processes: Discrete stochastic dynamic programming. John Wiley & Sons."},{"volume-title":"CAV (1) (Lecture Notes in Computer Science)","author":"Randour Mickael","key":"e_1_3_2_1_44_1","unstructured":"Mickael Randour , Jean-Fran\u00e7ois Raskin , and Ocan Sankur . 2015. Percentile Queries in Multi-dimensional Markov Decision Processes . In CAV (1) (Lecture Notes in Computer Science) , Vol. 9206 . Springer , 123--139. Mickael Randour, Jean-Fran\u00e7ois Raskin, and Ocan Sankur. 2015. Percentile Queries in Multi-dimensional Markov Decision Processes. In CAV (1) (Lecture Notes in Computer Science), Vol. 9206. Springer, 123--139."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-016-0262-7"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejcon.2016.04.009"},{"volume-title":"Robust Multidimensional Mean-Payoff Games are Undecidable","author":"Velner Yaron","key":"e_1_3_2_1_47_1","unstructured":"Yaron Velner . 2015. Robust Multidimensional Mean-Payoff Games are Undecidable . In FoSSaCS. Springer , 312--327. Yaron Velner. 2015. Robust Multidimensional Mean-Payoff Games are Undecidable. In FoSSaCS. Springer, 312--327."}],"event":{"name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"location":"Saarbr\u00fccken Germany","acronym":"LICS '20"},"container-title":["Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394761","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394761","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:35Z","timestamp":1750197755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394761"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":46,"alternative-id":["10.1145\/3373718.3394761","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394761","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}