{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T16:06:53Z","timestamp":1725984413402},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319952451"},{"type":"electronic","value":"9783319952468"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-95246-8_9","type":"book-chapter","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T06:50:32Z","timestamp":1531983032000},"page":"143-161","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Average Response Time"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Henzinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Otop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,20]]},"reference":[{"issue":"2","key":"9_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10703-010-0105-x","volume":"38","author":"L Brim","year":"2011","unstructured":"Brim, L., Chaloupka, J., Doyen, L., Gentilini, R., Raskin, J.: Faster algorithms for mean-payoff games. Formal Methods Syst. Des. 38(2), 97\u2013118 (2011). https:\/\/doi.org\/10.1007\/s10703-010-0105-x","journal-title":"Formal Methods Syst. Des."},{"issue":"4","key":"9_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1805950.1805953","volume":"11","author":"K Chatterjee","year":"2010","unstructured":"Chatterjee, K., Doyen, L., Henzinger, T.A.: Quantitative languages. ACM TOCL 11(4), 23 (2010)","journal-title":"ACM TOCL"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, M.: An O(n$${}^{\\text{2}}$$) time algorithm for alternating B\u00fcchi games. In: SODA 2012, pp. 1386\u20131399. ACM-SIAM (2012)","DOI":"10.1137\/1.9781611973099.109"},{"issue":"3","key":"9_CR4","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":"9_CR5","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Otop, J.: Bidirectional nested weighted automata. In: CONCUR 2017 (to appear)","DOI":"10.1145\/3152769"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Chatterjee, K., Henzinger, T.A., Otop, J.: Nested weighted automata. In: LICS 2015, pp. 725\u2013737 (2015)","DOI":"10.1109\/LICS.2015.72"},{"key":"9_CR7","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Henzinger, T.A., Otop, J.: Nested weighted limit-average automata of bounded width. In: MFCS 2016, pp. 24:1\u201324:14 (2016). https:\/\/doi.org\/10.4230\/LIPIcs.MFCS.2016.24","DOI":"10.4230\/LIPIcs.MFCS.2016.24"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Chatterjee, K., Henzinger, T.A., Otop, J.: Quantitative automata under probabilistic semantics. In: LICS 2016, pp. 76\u201385 (2016). https:\/\/doi.org\/10.1145\/2933575.2933588","DOI":"10.1145\/2933575.2933588"},{"key":"9_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01492-5","volume-title":"Handbook of Weighted Automata","author":"M Droste","year":"2009","unstructured":"Droste, M., Kuich, W., Vogler, H.: Handbook of Weighted Automata, 1st edn. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01492-5","edition":"1"},{"issue":"2","key":"9_CR10","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01768705","volume":"8","author":"A Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Mycielski, J.: Positional strategies for mean payoff games. Int. J. Game Theory 8(2), 109\u2013113 (1979)","journal-title":"Int. J. Game Theory"},{"key":"9_CR11","volume-title":"An Introduction to Probability Theory and its Applications","author":"W Feller","year":"1971","unstructured":"Feller, W.: An Introduction to Probability Theory and its Applications. Wiley, Hoboken (1971)"},{"key":"9_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4054-9","volume-title":"Competitive Markov Decision Processes","author":"J Filar","year":"1996","unstructured":"Filar, J., Vrieze, K.: Competitive Markov Decision Processes. Springer, New York (1996). https:\/\/doi.org\/10.1007\/978-1-4612-4054-9"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","volume":"23","author":"RM Karp","year":"1978","unstructured":"Karp, R.M.: A characterization of the minimum cycle mean in a digraph. Discrete Math. 23(3), 309\u2013311 (1978)","journal-title":"Discrete Math."},{"issue":"2","key":"9_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.2307\/1971035","volume":"102","author":"DA Martin","year":"1975","unstructured":"Martin, D.A.: Borel determinacy. Ann. Math. 102(2), 363\u2013371 (1975). Second Series","journal-title":"Ann. Math."},{"key":"9_CR15","volume-title":"Software Engineer\u2019s Reference Book","author":"JA McDermid","year":"2013","unstructured":"McDermid, J.A.: Software Engineer\u2019s Reference Book. Elsevier, Amsterdam (2013)"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(95)00188-3","volume":"158","author":"U Zwick","year":"1996","unstructured":"Zwick, U., Paterson, M.: The complexity of mean payoff games on graphs. Theor. Comput. Sci. 158(1), 343\u2013359 (1996)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Principles of Modeling"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95246-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,21]],"date-time":"2019-10-21T00:29:59Z","timestamp":1571617799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-95246-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319952451","9783319952468"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95246-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}