{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T09:56:54Z","timestamp":1776333414896,"version":"3.51.2"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319633862","type":"print"},{"value":"9783319633879","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-63387-9_10","type":"book-chapter","created":{"date-parts":[[2017,7,12]],"date-time":"2017-07-12T08:53:43Z","timestamp":1499849623000},"page":"201-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Value Iteration for Long-Run Average Reward in Markov Decision Processes"],"prefix":"10.1007","author":[{"given":"Pranav","family":"Ashok","sequence":"first","affiliation":[]},{"given":"Krishnendu","family":"Chatterjee","sequence":"additional","affiliation":[]},{"given":"Przemys\u0142aw","family":"Daca","sequence":"additional","affiliation":[]},{"given":"Jan","family":"K\u0159et\u00ednsk\u00fd","sequence":"additional","affiliation":[]},{"given":"Tobias","family":"Meggendorfer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,13]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Ashok, P., Chatterjee, K., Daca, P., K\u0159et\u00ednsk\u00fd, J., Meggendorfer, T.: Value iteration for long-run average reward in Markov decision processes. Technical report arXiv:1705.02326, arXiv.org (2017)","DOI":"10.1007\/978-3-319-63387-9_10"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-10(1:13)2014","volume":"10","author":"T Br\u00e1zdil","year":"2014","unstructured":"Br\u00e1zdil, T., Bro\u017eek, V., Chatterjee, K., Forejt, V., Ku\u010dera, A.: Markov decision processes with multiple long-run average objectives. LMCS 10(1), 1\u201329 (2014). doi:10.2168\/LMCS-10(1:13)2014","journal-title":"LMCS"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-319-11936-6_8","volume-title":"Automated Technology for Verification and Analysis","author":"T Br\u00e1zdil","year":"2014","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Chmel\u00edk, M., Forejt, V., K\u0159et\u00ednsk\u00fd, J., Kwiatkowska, M., Parker, D., Ujma, M.: Verification of Markov decision processes using learning algorithms. In: Cassez, F., Raskin, J.-F. (eds.) ATVA 2014. LNCS, vol. 8837, pp. 98\u2013114. Springer, Cham (2014). doi:10.1007\/978-3-319-11936-6_8"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Forejt, V., Kucera, A.: Trading performance for stability in Markov decision processes. In: LICS, pp. 331\u2013340 (2013)","DOI":"10.1109\/LICS.2013.39"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-662-46681-0_12","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T Br\u00e1zdil","year":"2015","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Forejt, V., Ku\u010dera, A.: MultiGain: a controller synthesis tool for MDPs with multiple mean-payoff objectives. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 181\u2013187. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46681-0_12"},{"key":"10_CR6","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"10_CR7","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":"10_CR8","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, M.: An O(\n$${n}^{2}$$\n) time algorithm for alternating b\u00fcchi games. In: SODA, pp. 1386\u20131399. SIAM (2012)","DOI":"10.1137\/1.9781611973099.109"},{"issue":"3","key":"10_CR9","doi-asserted-by":"publisher","first-page":"15:1","DOI":"10.1145\/2597631","volume":"61","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Henzinger, M.: Efficient and dynamic algorithms for alternating b\u00fcchi games and maximal end-component decomposition. J. ACM 61(3), 15:1\u201315:40 (2014)","journal-title":"J. ACM"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-77050-3_39","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"K Chatterjee","year":"2007","unstructured":"Chatterjee, K.: Markov decision processes with multiple long-run average objectives. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 473\u2013484. Springer, Heidelberg (2007). doi:10.1007\/978-3-540-77050-3_39"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-662-43951-7_11","volume-title":"Automata, Languages, and Programming","author":"K Chatterjee","year":"2014","unstructured":"Chatterjee, K., Ibsen-Jensen, R.: The complexity of ergodic mean-payoff games. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 122\u2013133. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-43951-7_11"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Kom\u00e1rkov\u00e1, Z., K\u0159et\u00ednsk\u00fd, J.: Unifying two views on multiple mean-payoff objectives in Markov decision processes. In: LICS, pp. 244\u2013256 (2015)","DOI":"10.1109\/LICS.2015.32"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-642-39799-8_36","volume-title":"Computer Aided Verification","author":"K Chatterjee","year":"2013","unstructured":"Chatterjee, K., \u0141\u0105cki, J.: Faster algorithms for Markov decision processes with low treewidth. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 543\u2013558. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-39799-8_36"},{"issue":"4","key":"10_CR14","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1145\/210332.210339","volume":"42","author":"C Courcoubetis","year":"1995","unstructured":"Courcoubetis, C., Yannakakis, M.: The complexity of probabilistic verification. J. ACM 42(4), 857\u2013907 (1995)","journal-title":"J. ACM"},{"key":"10_CR15","unstructured":"de Alfaro, L.: Formal verification of probabilistic systems. Ph.D. thesis, Stanford University (1997)"},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s00446-003-0102-z","volume":"17","author":"M Duflot","year":"2004","unstructured":"Duflot, M., Fribourg, L., Picaronny, C.: Randomized dining philosophers without fairness assumption. Distrib. Comput. 17(1), 65\u201376 (2004)","journal-title":"Distrib. Comput."},{"key":"10_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4054-9","volume-title":"Competitive Markov Decision Processes","author":"J Filar","year":"1997","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, New York (1997). doi:10.1007\/978-1-4612-4054-9"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2013.08.020","volume":"538","author":"S Giro","year":"2014","unstructured":"Giro, S.: Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes. Theor. Comput. Sci. 538, 70\u201383 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-11439-2_10","volume-title":"Reachability Problems","author":"S Haddad","year":"2014","unstructured":"Haddad, S., Monmege, B.: Reachability in MDPs: refining convergence of value iteration. In: Ouaknine, J., Potapov, I., Worrell, J. (eds.) RP 2014. LNCS, vol. 8762, pp. 125\u2013137. Springer, Cham (2014). doi:10.1007\/978-3-319-11439-2_10"},{"key":"10_CR20","volume-title":"Dynamic Programming and Markov Processes","author":"RA Howard","year":"1960","unstructured":"Howard, R.A.: Dynamic Programming and Markov Processes. MIT Press, New York, London, Cambridge (1960)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-22110-1_47"},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10703-006-0005-2","volume":"29","author":"M Kwiatkowska","year":"2006","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Sproston, J.: Performance analysis of probabilistic timed automata using digital clocks. Formal Methods Syst. Des. 29, 33\u201378 (2006)","journal-title":"Formal Methods Syst. Des."},{"issue":"12\u201313","key":"10_CR23","doi-asserted-by":"publisher","first-page":"1272","DOI":"10.1016\/j.tcs.2008.12.058","volume":"410","author":"M Kwiatkowska","year":"2009","unstructured":"Kwiatkowska, M., Norman, G., Parker, D., Vigliotti, M.G.: Probabilistic mobile ambients. Theoret. Comput. Sci. 410(12\u201313), 1272\u20131303 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-31424-7_25","volume-title":"Computer Aided Verification","author":"A Komuravelli","year":"2012","unstructured":"Komuravelli, A., P\u0103s\u0103reanu, C.S., Clarke, E.M.: Assume-guarantee abstraction refinement for probabilistic systems. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 310\u2013326. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31424-7_25"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"McMahan, H.B., Likhachev, M., Gordon, G.J.: Bounded real-time dynamic programming: RTDP with monotone upper bounds and performance guarantees. In: ICML, pp. 569\u2013576 (2005)","DOI":"10.1145\/1102351.1102423"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-36078-6_20","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"AK McIver","year":"2002","unstructured":"McIver, A.K., Morgan, C.C.: Games, probability, and the quantitative \n$$\\mu $$\n-calculus qM\n          \n$$\\mu $$\n. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS, vol. 2514, pp. 292\u2013310. Springer, Heidelberg (2002). doi:10.1007\/3-540-36078-6_20"},{"issue":"1","key":"10_CR27","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1182613.1182616","volume":"8","author":"A McIver","year":"2007","unstructured":"McIver, A., Morgan, C.: Results on the quantitative \n$$\\mu $$\n-calculus qMu. ACM Trans. Comput. Logic 8(1), 3 (2007)","journal-title":"ACM Trans. Comput. Logic"},{"key":"10_CR28","unstructured":"Pineau, J., Gordon, G.J., Thrun, S.: Point-based value iteration: an anytime algorithm for POMDPs. In: IJCAI, pp. 1025\u20131032 (2003)"},{"key":"10_CR29","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Hoboken (1994)"},{"issue":"1","key":"10_CR30","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/0022-0000(82)90010-1","volume":"25","author":"O Michael","year":"1982","unstructured":"Michael, O.: N-Process mutual exclusion with bounded waiting by 4 Log2N-valued shared variable. J. Comput. Syst. Sci. 25(1), 66\u201375 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR31","unstructured":"Segala, R.: Modelling and verification of randomized distributed real time systems. Ph.D. thesis, Massachusetts Institute of Technology (1995)"},{"issue":"5","key":"10_CR32","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1214\/aoms\/1177699272","volume":"37","author":"AF Veinott","year":"1966","unstructured":"Veinott, A.F.: On finding optimal policies in discrete dynamic programming with no discounting. Ann. Math. Statist. 37(5), 1284\u20131294 (1966)","journal-title":"Ann. Math. Statist."},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Wimmer, R., Braitling, B., Becker, B., Hahn, E.M., Crouzen, P., Hermanns, H., Dhama, A., Theel, O.E.: Symblicit calculation of long-run averages for concurrent probabilistic systems. In: QEST, pp. 27\u201336 (2010)","DOI":"10.1109\/QEST.2010.12"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63387-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,13]],"date-time":"2021-07-13T00:17:35Z","timestamp":1626135455000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-63387-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319633862","9783319633879"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63387-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"13 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CAV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computer Aided Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Heidelberg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cav2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cavconference.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}