{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:46:36Z","timestamp":1755999996928,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,7,9]],"date-time":"2018-07-09T00:00:00Z","timestamp":1531094400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,7,9]]},"DOI":"10.1145\/3209108.3209185","type":"proceedings-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T12:14:43Z","timestamp":1530101683000},"page":"36-45","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Distribution-based objectives for Markov Decision Processes"],"prefix":"10.1145","author":[{"given":"S.","family":"Akshay","sequence":"first","affiliation":[{"name":"Dept of CSE, Indian Institute of Technology Bombay, India"}]},{"given":"Blaise","family":"Genest","sequence":"additional","affiliation":[{"name":"Univ Rennes, CNRS, IRISA, France"}]},{"given":"Nikhil","family":"Vyas","sequence":"additional","affiliation":[{"name":"EECS, MIT, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,7,9]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1109\/LICS.2012.17"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1145\/2629417"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1016\/j.ipl.2014.08.013"},{"key":"e_1_3_2_1_4_1","first-page":"1","article-title":"On Regularity of unary Probabilistic Automata.. In STACS'16","volume":"8","author":"Akshay S.","year":"2016","unstructured":"S. Akshay , Blaise Genest , Bruno Karelovic , and Nikhil Vyas . 2016 . On Regularity of unary Probabilistic Automata.. In STACS'16 . LIPIcs , 8 : 1 -- 8 :14. S. Akshay, Blaise Genest, Bruno Karelovic, and Nikhil Vyas. 2016. On Regularity of unary Probabilistic Automata.. In STACS'16. LIPIcs, 8:1--8:14.","journal-title":"LIPIcs"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1145\/3209108.3209185"},{"volume-title":"CSL'02","author":"Beauquier D.","unstructured":"D. Beauquier , A. Rabinovich , and A. Slissenko . 2002. A Logic of Probability with Decidable Model Checking . In CSL'02 . 306--321. D. Beauquier, A. Rabinovich, and A. Slissenko. 2002. A Logic of Probability with Decidable Model Checking. In CSL'02. 306--321.","key":"e_1_3_2_1_6_1"},{"doi-asserted-by":"crossref","unstructured":"Alberto Bertoni. 1974. The solution of problems relative to probabilistic automata in the frame of the formal languages theory. In GI Jahrestagung. 107--112.   Alberto Bertoni. 1974. The solution of problems relative to probabilistic automata in the frame of the formal languages theory. In GI Jahrestagung. 107--112.","key":"e_1_3_2_1_7_1","DOI":"10.1007\/978-3-662-40087-6_6"},{"unstructured":"Nathalie Bertrand Miheer Dewaskar Blaise Genest and Hugo Gimbert. 2017. Controlling a Population.. In Concur'17 (LiPIcs). 12:1--16.  Nathalie Bertrand Miheer Dewaskar Blaise Genest and Hugo Gimbert. 2017. Controlling a Population.. In Concur'17 (LiPIcs). 12:1--16.","key":"e_1_3_2_1_8_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1016\/S0304-3975(00)00399-6"},{"key":"e_1_3_2_1_10_1","first-page":"329","article-title":"Decidable Problems for Unary PFAs","volume":"8657","author":"Chadha R.","year":"2014","unstructured":"R. Chadha , Dileep Kini , and M. Viswanathan . 2014 . Decidable Problems for Unary PFAs . In QEST. LNCS 8657 , 329 -- 344 . R. Chadha, Dileep Kini, and M. Viswanathan. 2014. Decidable Problems for Unary PFAs. In QEST. LNCS 8657, 329--344.","journal-title":"QEST. LNCS"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/QEST.2011.22"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/LICS.2012.29"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1007\/978-3-642-54830-7_4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1007\/s10472-013-9332-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/LICS.2012.40"},{"key":"e_1_3_2_1_17_1","first-page":"527","article-title":"Probabilistic Automata on Finite Words: Decidable and Undecidable Problems","volume":"6199","author":"Gimbert H.","year":"2010","unstructured":"H. Gimbert and Y. Ouahladj . 2010 . Probabilistic Automata on Finite Words: Decidable and Undecidable Problems . In ICALP. LNCS 6199 , 527 -- 538 . H. Gimbert and Y. Ouahladj. 2010. Probabilistic Automata on Finite Words: Decidable and Undecidable Problems. In ICALP. LNCS 6199, 527--538.","journal-title":"ICALP. LNCS"},{"key":"e_1_3_2_1_18_1","volume-title":"Ruzzo","author":"Greenlaw Raymond","year":"1995","unstructured":"Raymond Greenlaw , H. James Hoover , and Walter L . Ruzzo . 1995 . Limits to Parallel Computation : P-completeness Theory. Oxford University Press , Inc. Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo. 1995. Limits to Parallel Computation: P-completeness Theory. Oxford University Press, Inc."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1016\/S0747-7171(88)80005-1"},{"doi-asserted-by":"crossref","unstructured":"Darald J. Hartfiel. 1998. Markov Set-Chains. Springer.  Darald J. Hartfiel. 1998. Markov Set-Chains. Springer.","key":"e_1_3_2_1_20_1","DOI":"10.1007\/BFb0094586"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1215\/S0012-7094-41-00838-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1016\/S0004-3702(02)00378-8"},{"doi-asserted-by":"crossref","unstructured":"L. Maruthi I. Tkachev A. Carta E. Cinquemani P. Hersen G. Batt and A. Abate. 2014. Towards real-time control of gene expression at the single cell level: a stochastic control approach. In CMSB. LNCS\/LNBI 155--172.  L. Maruthi I. Tkachev A. Carta E. Cinquemani P. Hersen G. Batt and A. Abate. 2014. Towards real-time control of gene expression at the single cell level: a stochastic control approach. In CMSB. LNCS\/LNBI 155--172.","key":"e_1_3_2_1_23_1","DOI":"10.1007\/978-3-319-12982-2_12"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1145\/3049797.3049798"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1007\/978-3-662-43951-7_28"},{"key":"e_1_3_2_1_26_1","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"Puterman Martin L.","unstructured":"Martin L. Puterman . 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming ( 1 st ed.). John Wiley & Sons, Inc. Martin L. Puterman. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming (1st ed.). John Wiley & Sons, Inc.","edition":"1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1007\/978-3-642-11805-0_32"},{"volume-title":"Computer-Aided Verification, CAV (LNCS)","author":"Tiwari A.","unstructured":"A. Tiwari . 2004. Termination of linear programs . In Computer-Aided Verification, CAV (LNCS) , Vol. 3114 . Springer , 70--82. A. Tiwari. 2004. Termination of linear programs. In Computer-Aided Verification, CAV (LNCS), Vol. 3114. Springer, 70--82.","key":"e_1_3_2_1_28_1"},{"unstructured":"M. Hirvensalo V Halava T. Harju and J. Karhum\u00e4ki. 2005. Skolem's problem - on the border between decidability and undecidability. In TUCS Technical Report Number 683.  M. Hirvensalo V Halava T. Harju and J. Karhum\u00e4ki. 2005. Skolem's problem - on the border between decidability and undecidability. In TUCS Technical Report Number 683.","key":"e_1_3_2_1_29_1"},{"volume-title":"Variants of Quantified Linear Programming and Quantified Linear Implication. In ISALM'14","author":"Wojciechowski Piotr J.","unstructured":"Piotr J. Wojciechowski , Pavlos Eirinakis , and K. Subramani . 2014 . Variants of Quantified Linear Programming and Quantified Linear Implication. In ISALM'14 . Piotr J. Wojciechowski, Pavlos Eirinakis, and K. Subramani. 2014. Variants of Quantified Linear Programming and Quantified Linear Implication. In ISALM'14.","key":"e_1_3_2_1_30_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1007\/s10472-017-9537-y"}],"event":{"sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"],"acronym":"LICS '18","name":"LICS '18: 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Oxford United Kingdom"},"container-title":["Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209185","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3209108.3209185","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:07:08Z","timestamp":1750212428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3209108.3209185"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7,9]]},"references-count":30,"alternative-id":["10.1145\/3209108.3209185","10.1145\/3209108"],"URL":"https:\/\/doi.org\/10.1145\/3209108.3209185","relation":{},"subject":[],"published":{"date-parts":[[2018,7,9]]},"assertion":[{"value":"2018-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}