{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:00:55Z","timestamp":1725897655543},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315848"},{"type":"electronic","value":"9783642315855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31585-5_16","type":"book-chapter","created":{"date-parts":[[2012,6,23]],"date-time":"2012-06-23T11:56:29Z","timestamp":1340452589000},"page":"141-152","source":"Crossref","is-referenced-by-count":7,"title":["Minimizing Expected Termination Time in One-Counter Markov Decision Processes"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Br\u00e1zdil","sequence":"first","affiliation":[]},{"given":"Anton\u00edn","family":"Ku\u010dera","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Novotn\u00fd","sequence":"additional","affiliation":[]},{"given":"Dominik","family":"Wojtczak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"unstructured":"Proceedings of FST&TCS 2010. LIPIcs, vol.\u00a08. Schloss Dagstuhl (2010)","key":"16_CR1"},{"unstructured":"Br\u00e1zdil, T., Bro\u017eek, V., Etessami, K.: One-counter stochastic games. In: Proceedings of FST&TCS 2010 [1], pp. 108\u2013119","key":"16_CR2"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1007\/978-3-642-22012-8_26","volume-title":"Automata, Languages and Programming","author":"T. Br\u00e1zdil","year":"2011","unstructured":"Br\u00e1zdil, T., Bro\u017eek, V., Etessami, K., Ku\u010dera, A.: Approximating the Termination Value of One-Counter MDPs and Stochastic Games. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 332\u2013343. Springer, Heidelberg (2011)"},{"doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Bro\u017eek, V., Etessami, K., Ku\u010dera, A., Wojtczak, D.: One-counter Markov decision processes. In: Proceedings of SODA 2010, pp. 863\u2013874. SIAM (2010)","key":"16_CR4","DOI":"10.1137\/1.9781611973075.70"},{"issue":"5","key":"16_CR5","first-page":"520","volume":"206","author":"T. Br\u00e1zdil","year":"2008","unstructured":"Br\u00e1zdil, T., Bro\u017eek, V., Forejt, V., Ku\u010dera, A.: Reachability in recursive Markov decision processes. I&C\u00a0206(5), 520\u2013537 (2008)","journal-title":"I&C"},{"issue":"7","key":"16_CR6","first-page":"772","volume":"208","author":"T. Br\u00e1zdil","year":"2010","unstructured":"Br\u00e1zdil, T., Bro\u017eek, V., Ku\u010dera, A., Obdr\u017e\u00e1lek, J.: Qualitative reachability in stochastic BPA games. I&C\u00a0208(7), 772\u2013796 (2010)","journal-title":"I&C"},{"doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Ku\u010dera, A., Novotn\u00fd, P., Wojtczak, D.: Minimizing expected termination time in one-counter Markov decision processes. CoRR abs\/1205.1473 (2012)","key":"16_CR7","DOI":"10.1007\/978-3-642-31585-5_16"},{"key":"16_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-642-14162-1_50","volume-title":"Automata, Languages and Programming","author":"K. Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L.: Energy Parity Games. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part II. LNCS, vol.\u00a06199, pp. 599\u2013610. Springer, Heidelberg (2010)"},{"unstructured":"Chatterjee, K., Doyen, L., Henzinger, T., Raskin, J.F.: Generalized mean-payoff and energy games. In: Proceedings of FST&TCS 2010 [1], pp. 505\u2013516","key":"16_CR9"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/978-3-540-70575-8_58","volume-title":"Automata, Languages and Programming","author":"K. Etessami","year":"2008","unstructured":"Etessami, K., Wojtczak, D., Yannakakis, M.: Recursive Stochastic Games with Positive Rewards. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 711\u2013723. Springer, Heidelberg (2008)"},{"issue":"9","key":"16_CR11","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.peva.2009.12.009","volume":"67","author":"K. Etessami","year":"2010","unstructured":"Etessami, K., Wojtczak, D., Yannakakis, M.: Quasi-birth-death processes, tree-like QBDs, probabilistic 1-counter automata, and pushdown systems. Performance Evaluation\u00a067(9), 837\u2013857 (2010)","journal-title":"Performance Evaluation"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/11523468_72","volume-title":"Automata, Languages and Programming","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov Decision Processes and Recursive Stochastic Games. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 891\u2013903. Springer, Heidelberg (2005)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/11672142_52","volume-title":"STACS 2006","author":"K. Etessami","year":"2006","unstructured":"Etessami, K., Yannakakis, M.: Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 634\u2013645. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer (1996)","key":"16_CR14","DOI":"10.1007\/978-1-4612-4054-9"},{"unstructured":"G\u00f6ller, S., Lohrey, M.: Branching-time model checking of one-counter processes. In: Proceedings of STACS 2010. LIPIcs, vol.\u00a05, pp. 405\u2013416. Schloss Dagstuhl (2010)","key":"16_CR15"},{"issue":"1","key":"16_CR16","first-page":"1","volume":"188","author":"P. Jan\u010dar","year":"2004","unstructured":"Jan\u010dar, P., Ku\u010dera, A., Moller, F., Sawa, Z.: DP lower bounds for equivalence-checking and model-checking of one-counter automata. I&C\u00a0188(1), 1\u201319 (2004)","journal-title":"I&C"},{"issue":"5","key":"16_CR17","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.ipl.2007.06.006","volume":"104","author":"P. Jan\u010dar","year":"2007","unstructured":"Jan\u010dar, P., Sawa, Z.: A note on emptiness for alternating finite automata with a one-letter alphabet. IPL\u00a0104(5), 164\u2013167 (2007)","journal-title":"IPL"},{"issue":"1-3","key":"16_CR18","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/S0304-3975(03)00081-1","volume":"304","author":"A. Ku\u010dera","year":"2003","unstructured":"Ku\u010dera, A.: The complexity of bisimilarity-checking for one-counter processes. TCS\u00a0304(1-3), 157\u2013183 (2003)","journal-title":"TCS"},{"doi-asserted-by":"crossref","unstructured":"Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling. ASA-SIAM series on statistics and applied probability (1999)","key":"16_CR19","DOI":"10.1137\/1.9780898719734"},{"doi-asserted-by":"crossref","unstructured":"Puterman, M.: Markov Decision Processes. Wiley (1994)","key":"16_CR20","DOI":"10.1002\/9780470316887"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/11690634_23","volume-title":"Foundations of Software Science and Computation Structures","author":"O. Serre","year":"2006","unstructured":"Serre, O.: Parity Games Played on Transition Graphs of One-Counter Processes. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol.\u00a03921, pp. 337\u2013351. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Williams, D.: Probability with Martingales. Cambridge University Press (1991)","key":"16_CR22","DOI":"10.1017\/CBO9780511813658"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31585-5_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:13:27Z","timestamp":1620130407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31585-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315848","9783642315855"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31585-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}