{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:26:31Z","timestamp":1750220791246,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000921","name":"European Cooperation in Science and Technology","doi-asserted-by":"publisher","award":["COST Action 16228 GAMENET"],"award-info":[{"award-number":["COST Action 16228 GAMENET"]}],"id":[{"id":"10.13039\/501100000921","id-type":"DOI","asserted-by":"publisher"}]},{"name":"F.R.S.-FNRS & FWO","award":["EOS project Verifying Learning Artificial Intelligence Systems"],"award-info":[{"award-number":["EOS project Verifying Learning Artificial Intelligence Systems"]}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","award":["PDR project Subgame perfection in graph games"],"award-info":[{"award-number":["PDR project Subgame perfection in graph games"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"name":"F\u00e9d\u00e9ration Wallonie-Bruxelles","award":["ARC project Non-Zero Sum Game Graphs: Applications to Reactive Synthesis and Beyond"],"award-info":[{"award-number":["ARC project Non-Zero Sum Game Graphs: Applications to Reactive Synthesis and Beyond"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394805","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"195-208","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes"],"prefix":"10.1145","author":[{"given":"Rapha\u00ebl","family":"Berthon","sequence":"first","affiliation":[{"name":"Universit\u00e9 libre de Bruxelles, University of Antwerp"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shibashis","family":"Guha","sequence":"additional","affiliation":[{"name":"Universit\u00e9 libre de Bruxelles"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Raskin","sequence":"additional","affiliation":[{"name":"Universit\u00e9 libre de Bruxelles"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"27th International Conference on Concurrency Theory, CONCUR","author":"Almagor Shaull","year":"2016","unstructured":"Shaull Almagor , Orna Kupferman , and Yaron Velner . 2016 . Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis . In 27th International Conference on Concurrency Theory, CONCUR 2016. 9:1--9:15. Shaull Almagor, Orna Kupferman, and Yaron Velner. 2016. Minimizing Expected Cost Under Hard Boolean Constraints, with Applications to Quantitative Synthesis. In 27th International Conference on Concurrency Theory, CONCUR 2016. 9:1--9:15."},{"volume-title":"Principles of model checking","author":"Baier Christel","key":"e_1_3_2_1_2_1","unstructured":"Christel Baier and Joost-Pieter Katoen . 2008. Principles of model checking . MIT Press . Christel Baier and Joost-Pieter Katoen. 2008. Principles of model checking. MIT Press."},{"key":"e_1_3_2_1_3_1","volume-title":"Alternating Tree Automata with Qualitative Semantics. CoRR abs\/2002.03664","author":"Berthon Rapha\u00ebl","year":"2020","unstructured":"Rapha\u00ebl Berthon , Nathana\u00ebl Fijalkow , Emmanuel Filiot , Shibashis Guha , Bastien Maubert , Aniello Murano , Laureline Pinault , Sophie Pinchinat , Sasha Rubin , and Olivier Serre . 2020. Alternating Tree Automata with Qualitative Semantics. CoRR abs\/2002.03664 ( 2020 ). Rapha\u00ebl Berthon, Nathana\u00ebl Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, and Olivier Serre. 2020. Alternating Tree Automata with Qualitative Semantics. CoRR abs\/2002.03664 (2020)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Rapha\u00ebl Berthon Shibashis Guha and Jean-Fran\u00e7ois Raskin. 2020. Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes. (2020). arXiv:cs.LO\/2004.13789  Rapha\u00ebl Berthon Shibashis Guha and Jean-Fran\u00e7ois Raskin. 2020. Mixing Probabilistic and non-Probabilistic Objectives in Markov Decision Processes. (2020). arXiv:cs.LO\/2004.13789","DOI":"10.1145\/3373718.3394805"},{"key":"e_1_3_2_1_5_1","volume-title":"44th International Colloquium on Automata, Languages, and Programming, ICALP","author":"Berthon Rapha\u00ebl","year":"2017","unstructured":"Rapha\u00ebl Berthon , Mickael Randour , and Jean-Fran\u00e7ois Raskin . 2017 . Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. 121:1--121:15. Rapha\u00ebl Berthon, Mickael Randour, and Jean-Fran\u00e7ois Raskin. 2017. Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes. In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017. 121:1--121:15."},{"key":"e_1_3_2_1_6_1","volume-title":"43rd International Colloquium on Automata, Languages, and Programming, ICALP","author":"Bojanczyk Mikolaj","year":"2016","unstructured":"Mikolaj Bojanczyk . 2016 . Thin MSO with a probabilistic path quantifier. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Mikolaj Bojanczyk. 2016. Thin MSO with a probabilistic path quantifier. In 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_7_1","volume-title":"Emptiness of zero automata is decidable. arXiv preprint arXiv:1702.06858","author":"Boja\u0144czyk Mikolaj","year":"2017","unstructured":"Mikolaj Boja\u0144czyk , Hugo Gimbert , and Edon Kelmendi . 2017. Emptiness of zero automata is decidable. arXiv preprint arXiv:1702.06858 ( 2017 ). Mikolaj Boja\u0144czyk, Hugo Gimbert, and Edon Kelmendi. 2017. Emptiness of zero automata is decidable. arXiv preprint arXiv:1702.06858 (2017)."},{"key":"e_1_3_2_1_8_1","volume-title":"2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019. IEEE, 1--13","author":"Boja\u0144czyk Mikolaj","year":"2019","unstructured":"Mikolaj Boja\u0144czyk , E don Kelmendi , and Michal Skrzypczak . 2019 . MSO+ ▽ is undecidable . In 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019. IEEE, 1--13 . Mikolaj Boja\u0144czyk, E don Kelmendi, and Michal Skrzypczak. 2019. MSO+ ▽ is undecidable. In 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2019. IEEE, 1--13."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056010"},{"key":"e_1_3_2_1_10_1","volume-title":"ICALP","author":"Br\u00e1zdil Tom\u00e1\u0161","year":"2008","unstructured":"Tom\u00e1\u0161 Br\u00e1zdil , Vojt\u011bch Forejt , and Anton\u00edn Ku\u010dera . 2008 . Controller synthesis and verification for Markov decision processes with qualitative branching time objectives. In International Colloquium on Automata, Languages, and Programming , ICALP 2008. Springer, 148--159. Tom\u00e1\u0161 Br\u00e1zdil, Vojt\u011bch Forejt, and Anton\u00edn Ku\u010dera. 2008. Controller synthesis and verification for Markov decision processes with qualitative branching time objectives. In International Colloquium on Automata, Languages, and Programming, ICALP 2008. Springer, 148--159."},{"key":"e_1_3_2_1_11_1","volume-title":"Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. In 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 (LIPIcs)","volume":"25","author":"Bruy\u00e8re V\u00e9ronique","year":"2014","unstructured":"V\u00e9ronique Bruy\u00e8re , Emmanuel Filiot , Mickael Randour , and Jean-Fran\u00e7ois Raskin . 2014 . Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. In 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 (LIPIcs) , Vol. 25 . Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 199--213. V\u00e9ronique Bruy\u00e8re, Emmanuel Filiot, Mickael Randour, and Jean-Fran\u00e7ois Raskin. 2014. Meet Your Expectations With Guarantees: Beyond Worst-Case Synthesis in Quantitative Games. In 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014 (LIPIcs), Vol. 25. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 199--213."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.10.011"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055409"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629336"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71389-0_12"},{"key":"e_1_3_2_1_16_1","volume-title":"Combinations of Qualitative Winning for Stochastic Parity Games. In 30th International Conference on Concurrency Theory, CONCUR 2019 (LIPIcs)","volume":"140","author":"Chatterjee Krishnendu","year":"2019","unstructured":"Krishnendu Chatterjee and Nir Piterman . 2019 . Combinations of Qualitative Winning for Stochastic Parity Games. In 30th International Conference on Concurrency Theory, CONCUR 2019 (LIPIcs) , Vol. 140 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 6:1--6:17. http:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-121-4 Krishnendu Chatterjee and Nir Piterman. 2019. Combinations of Qualitative Winning for Stochastic Parity Games. In 30th International Conference on Concurrency Theory, CONCUR 2019 (LIPIcs), Vol. 140. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 6:1--6:17. http:\/\/www.dagstuhl.de\/dagpub\/978-3-95977-121-4"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71209-1_6"},{"key":"e_1_3_2_1_18_1","volume-title":"Alternating Nonzero Automata. In 29th International Conference on Concurrency Theory, CONCUR 2018 (Leibniz International Proceedings in Informatics (LIPIcs)), Sven Schewe and Lijun Zhang (Eds.)","volume":"118","author":"Fournier Paulin","year":"2018","unstructured":"Paulin Fournier and Hugo Gimbert . 2018 . Alternating Nonzero Automata. In 29th International Conference on Concurrency Theory, CONCUR 2018 (Leibniz International Proceedings in Informatics (LIPIcs)), Sven Schewe and Lijun Zhang (Eds.) , Vol. 118 . Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 13:1--13:16. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR. 2018.13 10.4230\/LIPIcs.CONCUR.2018.13 Paulin Fournier and Hugo Gimbert. 2018. Alternating Nonzero Automata. In 29th International Conference on Concurrency Theory, CONCUR 2018 (Leibniz International Proceedings in Informatics (LIPIcs)), Sven Schewe and Lijun Zhang (Eds.), Vol. 118. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 13:1--13:16. https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2018.13"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-27683-0_19"},{"key":"e_1_3_2_1_20_1","volume-title":"On the regular emptiness problem of subzero automata. arXiv preprint arXiv:1608.03319","author":"Michalewski Henryk","year":"2016","unstructured":"Henryk Michalewski , Matteo Mio , and Miko\u0142aj Boja\u0144czyk . 2016. On the regular emptiness problem of subzero automata. arXiv preprint arXiv:1608.03319 ( 2016 ). Henryk Michalewski, Matteo Mio, and Miko\u0142aj Boja\u0144czyk. 2016. On the regular emptiness problem of subzero automata. arXiv preprint arXiv:1608.03319 (2016)."},{"key":"e_1_3_2_1_21_1","volume-title":"Automatic Verification of Probabilistic Concurrent Finite-State Programs. In 26th Annual Symposium on Foundations of Computer Science, FOCS","author":"Vardi Moshe Y.","year":"1985","unstructured":"Moshe Y. Vardi . 1985 . Automatic Verification of Probabilistic Concurrent Finite-State Programs. In 26th Annual Symposium on Foundations of Computer Science, FOCS 1985. 327--338. Moshe Y. Vardi. 1985. Automatic Verification of Probabilistic Concurrent Finite-State Programs. In 26th Annual Symposium on Foundations of Computer Science, FOCS 1985. 327--338."}],"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.3394805","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394805","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:46Z","timestamp":1750200106000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":21,"alternative-id":["10.1145\/3373718.3394805","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394805","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"}}]}}