{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:31:09Z","timestamp":1743028269238,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030617387"},{"type":"electronic","value":"9783030617394"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-61739-4_5","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T23:11:38Z","timestamp":1602717098000},"page":"67-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Qualitative Multi-objective Reachability for Ordered Branching MDPs"],"prefix":"10.1007","author":[{"given":"Kousha","family":"Etessami","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emanuel","family":"Martinov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,15]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"e00747","DOI":"10.7554\/eLife.00747","volume":"2","author":"I Bozic","year":"2013","unstructured":"Bozic, I., et al.: Evolutionary dynamics of cancer in response to targeted combination therapy. eLife 2, e00747 (2013)","journal-title":"eLife"},{"issue":"3","key":"5_CR2","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":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-32589-2_26","volume-title":"Mathematical Foundations of Computer Science 2012","author":"T Chen","year":"2012","unstructured":"Chen, T., Dr\u00e4ger, K., Kiefer, S.: Model checking stochastic branching processes. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 271\u2013282. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_26"},{"issue":"10","key":"5_CR4","doi-asserted-by":"publisher","first-page":"1399","DOI":"10.1109\/9.720497","volume":"43","author":"C Courcoubetis","year":"1998","unstructured":"Courcoubetis, C., Yannakakis, M.: Markov decision processes and regular events. IEEE Trans. Autom. Control 43(10), 1399\u20131418 (1998)","journal-title":"IEEE Trans. Autom. Control"},{"key":"5_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790492","volume-title":"Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids","author":"R Durbin","year":"1998","unstructured":"Durbin, R., Eddy, S.R., Krogh, A., Mitchison, G.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge (1998)"},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1137\/16M105678X","volume":"46","author":"K Etessami","year":"2017","unstructured":"Etessami, K., Stewart, A., Yannakakis, M.: A Polynomial-time algorithm for computing extinction probabilities of multi-type branching processes. SIAM J. Computing 46(5), 1515\u20131553 (2017). (Incorporates part of the work of a conference paper in STOC 2012.)","journal-title":"SIAM J. Computing"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1287\/moor.2018.0970","volume":"45","author":"K Etessami","year":"2020","unstructured":"Etessami, K., Stewart, A., Yannakakis, M.: Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations. Math. Oper. Res. 45(1), 34\u201362 (2020). (Conference version in ICALP\u201912.)","journal-title":"Math. Oper. Res."},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.ic.2018.02.013","volume":"261","author":"K Etessami","year":"2018","unstructured":"Etessami, K., Stewart, A., Yannakakis, M.: Greatest fixed points of probabilistic min\/max polynomial equations, and reachability for branching Markov decision processes. Inf. Comput. 261(2), 355\u2013382 (2018). (Conference version in ICALP 2015.)","journal-title":"Inf. Comput."},{"key":"5_CR9","unstructured":"Etessami, K., Martinov, E., Stewart, A., Yannakakis, M.: Reachability for branching concurrent stochastic games. In: Proceedings of the 46th International Colloquium on Automata, Languages and Programming (ICALP) (2019). (All references are to the full preprint arXiv:1806.03907 .)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Etessami, K., Martinov, E.: Qualitative multi-objective reachability for ordered branching MDPs. Full preprint arXiv:2008.10591 (2020)","DOI":"10.1007\/978-3-030-61739-4_5"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Etessami, K., Kwiatkowska, M., Vardi, M.Y., Yannakakis, M.: Multi-objective model checking of Markov decision processes. LMCS 4(4), (2008)","DOI":"10.2168\/LMCS-4(4:8)2008"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Etessami, K., Yannakakis, M.: Recursive concurrent stochastic games. LMCS 4(4), (2008)","DOI":"10.2168\/LMCS-4(4:7)2008"},{"issue":"2","key":"5_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699431","volume":"62","author":"K Etessami","year":"2015","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov decision processes and recursive stochastic games. J. ACM 62(2), 1\u201369 (2015)","journal-title":"J. ACM"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462153.1462154","volume":"56","author":"K Etessami","year":"2009","unstructured":"Etessami, K., Yannakakis, M.: Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations. J. ACM 56(1), 1\u201366 (2009)","journal-title":"J. ACM"},{"key":"5_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629136","volume-title":"Branching Processes: Variation, Growth, and Extinction of Populations","author":"P Haccou","year":"2005","unstructured":"Haccou, P., Jagers, P., Vatutin, V.A.: Branching Processes: Variation, Growth, and Extinction of Populations. Cambridge University Press, Cambridge (2005)"},{"key":"5_CR16","series-title":"Interdisciplinary Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/b97371","volume-title":"Branching Processes in Biology","author":"M Kimmel","year":"2002","unstructured":"Kimmel, M., Axelrod, D.E.: Branching Processes in Biology. IAM, vol. 19. Springer, New York (2002). https:\/\/doi.org\/10.1007\/b97371"},{"key":"5_CR17","unstructured":"Michalewski, H., Mio, M.: On the problem of computing the probability of regular sets of trees. In: Proceedings of FSTTCS 2015, pp. 489\u2013502 (2015)"},{"key":"5_CR18","unstructured":"Przyby\u0142ko, M., Skrzypczak, M.: On the complexity of branching games with regular conditions. In: Proceedings of MFCS 2016, LIPICS, vol. 78 (2016)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-39799-8_6","volume-title":"Computer Aided Verification","author":"JG Reiter","year":"2013","unstructured":"Reiter, J.G., Bozic, I., Chatterjee, K., Nowak, M.A.: TTP: tool for tumor progression. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 101\u2013106. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_6"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-61739-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,8]],"date-time":"2021-04-08T21:26:26Z","timestamp":1617917186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-61739-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030617387","9783030617394"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-61739-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"15 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.irif.fr\/~rp2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}