{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:57:15Z","timestamp":1725544635568},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540323013"},{"type":"electronic","value":"9783540322887"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11672142_52","type":"book-chapter","created":{"date-parts":[[2006,2,28]],"date-time":"2006-02-28T03:27:54Z","timestamp":1141097274000},"page":"634-645","source":"Crossref","is-referenced-by-count":18,"title":["Efficient Qualitative Analysis of Classes of Recursive Markov Decision Processes and Simple Stochastic Games"],"prefix":"10.1007","author":[{"given":"Kousha","family":"Etessami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mihalis","family":"Yannakakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1145\/1075382.1075387","volume":"27","author":"R. Alur","year":"2005","unstructured":"Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T.W., Yannakakis, M.: Analysis of recursive state machines. ACM Trans. Progr. Lang. Sys.\u00a027, 786\u2013818 (2005)","journal-title":"ACM Trans. Progr. Lang. Sys."},{"key":"52_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_12","volume-title":"STACS 2005","author":"T. Br\u00e1zdil","year":"2005","unstructured":"Br\u00e1zdil, T., Ku\u010dera, A., Stra\u017eovsk\u00fd, O.: Decidability of temporal properties of probabilistic pushdown automata. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol.\u00a03404, Springer, Heidelberg (2005)"},{"issue":"2","key":"52_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A. Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Inf. & Comp.\u00a096(2), 203\u2013224 (1992)","journal-title":"Inf. & Comp."},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Denardo, E.V., Rothblum, U.G.: Totally expanding multiplicative systems. unpublished manuscript (submitted, 2005)","DOI":"10.1016\/j.laa.2005.03.033"},{"key":"52_CR5","doi-asserted-by":"crossref","unstructured":"Denardo, E.V., Rothblum, U.G.: A turnpike theorem for a risk-sensitive Markov decision process with stopping. unpublished manuscript (submitted, 2005)","DOI":"10.1137\/S0363012904442616"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Esparza, J., Ku\u010dera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: Proc. of 19th IEEE LICS 2004 (2004)","DOI":"10.1109\/LICS.2004.1319596"},{"key":"52_CR7","unstructured":"Everett, C.J., Ulam, S.: Multiplicative systems, part i., ii, and iii. Technical Report 683,690,707, Los Alamos Scientific Laboratory (1948)"},{"key":"52_CR8","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Rough Sets and Current Trends in Computing","author":"K. Etessami","year":"2001","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. In: Ziarko, W., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol.\u00a02005, Springer, Heidelberg (2001)"},{"key":"52_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_17","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Etessami","year":"2005","unstructured":"Etessami, K., Yannakakis, M.: Algorithmic verification of recursive probabilistic state machines. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, Springer, Heidelberg (2005)"},{"key":"52_CR10","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Rough Sets and Current Trends in Computing","author":"K. Etessami","year":"2001","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov decision processes and recursive stochastic games. In: Ziarko, W., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol.\u00a02005, Springer, Heidelberg (2001)"},{"key":"52_CR11","volume-title":"Competitive Markov Decision Processes","author":"J. Filar","year":"1997","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, Heidelberg (1997)"},{"key":"52_CR12","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S.: Some NP-complete geometric problems. In: 8th ACM STOC, pp. 10\u201322 (1976)","DOI":"10.1145\/800113.803626"},{"key":"52_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization, 2nd edn. Springer, Heidelberg (1993)","edition":"2"},{"key":"52_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-51866-9","volume-title":"The Theory of Branching Processes","author":"T.E. Harris","year":"1963","unstructured":"Harris, T.E.: The Theory of Branching Processes. Springer, Heidelberg (1963)"},{"key":"52_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R.J. Horn","year":"1985","unstructured":"Horn, R.J., Johnson, C.R.: Matrix Analysis. Cambridge U. Press, Cambridge (1985)"},{"key":"52_CR16","volume-title":"Branching Processes with Biological Applications","author":"P. Jagers","year":"1975","unstructured":"Jagers, P.: Branching Processes with Biological Applications. Wiley, Chichester (1975)"},{"key":"52_CR17","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1307\/mmj\/1028999140","volume":"11","author":"K. Mahler","year":"1964","unstructured":"Mahler, K.: An inequality for the discriminant of a polynomial. Michigan Math J.\u00a011, 257\u2013262 (1964)","journal-title":"Michigan Math J."},{"issue":"4","key":"52_CR18","doi-asserted-by":"publisher","first-page":"1565","DOI":"10.2307\/2586667","volume":"63","author":"D.A. Martin","year":"1998","unstructured":"Martin, D.A.: Determinacy of Blackwell games. J. Symb. Logic\u00a063(4), 1565\u20131581 (1998)","journal-title":"J. Symb. Logic"},{"key":"52_CR19","volume-title":"Foundations of Statistical Natural Language Processing","author":"C. Manning","year":"1999","unstructured":"Manning, C., Sch\u00fctze, H.: Foundations of Statistical Natural Language Processing. MIT Press, Cambridge (1999)"},{"key":"52_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes","author":"M.L. Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes. Wiley, Chichester (1994)"},{"key":"52_CR21","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1287\/moor.7.4.582","volume":"7","author":"U.G. Rothblum","year":"1982","unstructured":"Rothblum, U.G., Whittle, P.: Growth optimality for branching Markov decision chains. Math. of Operations Research\u00a07, 582\u2013601 (1982)","journal-title":"Math. of Operations Research"},{"issue":"23","key":"52_CR22","doi-asserted-by":"publisher","first-page":"5112","DOI":"10.1093\/nar\/22.23.5112","volume":"22","author":"Y. Sakakibara","year":"1994","unstructured":"Sakakibara, Y., Brown, M., Hughey, R., Mian, I.S., Sjolander, K., Underwood, R., Haussler, D.: Stochastic context-free grammars for tRNA modeling. Nucleic Acids Research\u00a022(23), 5112\u20135120 (1994)","journal-title":"Nucleic Acids Research"}],"container-title":["Lecture Notes in Computer Science","STACS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11672142_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T23:31:38Z","timestamp":1555457498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11672142_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540323013","9783540322887"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11672142_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}