{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:12:36Z","timestamp":1750824756570,"version":"3.41.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319665825"},{"type":"electronic","value":"9783319665832"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-66583-2_2","type":"book-chapter","created":{"date-parts":[[2017,8,12]],"date-time":"2017-08-12T02:02:48Z","timestamp":1502503368000},"page":"19-32","source":"Crossref","is-referenced-by-count":0,"title":["Bounded Aggregation for Continuous Time Markov Decision Processes"],"prefix":"10.1007","author":[{"given":"Peter","family":"Buchholz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iryna","family":"Dohndorf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Frank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dimitri","family":"Scheftelowitsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,13]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-319-46520-3_2","volume-title":"Automated Technology for Verification and Analysis","author":"A Abate","year":"2016","unstructured":"Abate, A., \u010ce\u0161ka, M., Kwiatkowska, M.: Approximate policy iteration for Markov decision processes via quantitative adaptive aggregations. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 13\u201331. Springer, Cham (2016). doi: 10.1007\/978-3-319-46520-3_2"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1017\/S0021900200031375","volume":"24","author":"FJ Beutler","year":"1987","unstructured":"Beutler, F.J., Ross, K.W.: Uniformization for semi-Markov decision processes under stationary policies. J. Appl. Probability 24, 644\u2013656 (1987)","journal-title":"J. Appl. Probability"},{"issue":"6","key":"2_CR3","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1002\/nla.792","volume":"18","author":"P Buchholz","year":"2011","unstructured":"Buchholz, P.: Bounding reward measures of Markov models using the Markov decision processes. Numerical Lin. Alg. with Applic. 18(6), 919\u2013930 (2011)","journal-title":"Numerical Lin. Alg. with Applic."},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-66583-2_1","volume-title":"Computer Performance Engineering","author":"P Buchholz","year":"2017","unstructured":"Buchholz, P., Dohndorf, I., Scheftelowitsch, D.: Analysis of Markov decision processes under parameter uncertainty. In: Reinecke, P., Di Marco, A. (eds.) EPEW 2017. LNCS, vol. 10497, pp. 3\u201318. Springer, Cham (2017). doi: 10.1007\/978-3-319-66583-2_1"},{"doi-asserted-by":"crossref","unstructured":"Buchholz, P., Hahn, E.M., Hermanns, H., Zhang, L.: Model checking algorithms for CTMDPs. In: Computer Aided Verification - 23rd International Conference, CAV 2011, Snowbird, UT, USA, 14\u201320 July 2011, Proceedings, pp. 225\u2013242 (2011)","key":"2_CR5","DOI":"10.1007\/978-3-642-22110-1_19"},{"key":"2_CR6","series-title":"SpringerBriefs in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-06674-5","volume-title":"Input Modeling with Phase-Type Distributions and Markov Models","author":"P Buchholz","year":"2014","unstructured":"Buchholz, P., Kriege, J., Felko, I.: Input Modeling with Phase-Type Distributions and Markov Models. SM. Springer, Cham (2014)"},{"issue":"4","key":"2_CR7","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1145\/1634.1637","volume":"31","author":"P Courtois","year":"1984","unstructured":"Courtois, P., Semal, P.: Bounds for the positive eigenvectors of nonnegative matrices and for their approximations by decomposition. J. ACM 31(4), 804\u2013825 (1984)","journal-title":"J. ACM"},{"unstructured":"Dean, T.L., Givan, R., Leach, S.M.: Model reduction techniques for computing approximately optimal solutions for Markov decision processes. In: Geiger, D., Shenoy, P.P. (eds.) UAI 1997: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, Brown University, Providence, Rhode Island, USA, 1\u20133 August 1997, pp. 124\u2013131. Morgan Kaufmann (1997)","key":"2_CR8"},{"issue":"1\u20133","key":"2_CR9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-5316(94)90015-9","volume":"20","author":"G Franceschinis","year":"1994","unstructured":"Franceschinis, G., Muntz, R.R.: Bounds for quasi-lumpable Markov chains. Perform. Eval. 20(1\u20133), 223\u2013243 (1994)","journal-title":"Perform. Eval."},{"issue":"1\u20132","key":"2_CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/S0004-3702(02)00376-4","volume":"147","author":"R Givan","year":"2003","unstructured":"Givan, R., Dean, T.L., Greig, M.: Equivalence notions and model minimization in Markov decision processes. Artif. Intell. 147(1\u20132), 163\u2013223 (2003)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"2_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0004-3702(00)00047-3","volume":"122","author":"R Givan","year":"2000","unstructured":"Givan, R., Leach, S.M., Dean, T.L.: Bounded-parameter Markov decision processes. Artif. Intell. 122(1\u20132), 71\u2013109 (2000)","journal-title":"Artif. Intell."},{"unstructured":"Li, L., Walsh, T.J., Littman, M.L.: Towards a unified theory of state abstraction for MDPs. In: International Symposium on Artificial Intelligence and Mathematics, ISAIM 2006, Fort Lauderdale, Florida, USA, 4\u20136 January 2006 (2006)","key":"2_CR12"},{"key":"2_CR13","volume-title":"Markov Decision Processes","author":"ML Puterman","year":"2005","unstructured":"Puterman, M.L.: Markov Decision Processes. Wiley, New York (2005)"},{"doi-asserted-by":"crossref","unstructured":"Ren, Z., Krogh, B.: State aggregation in Markov decision processes. In: Proceedings of the 41st IEEE Conference on Decision and Control, vol. 4, pp. 3819\u20133824. IEEE (2002)","key":"2_CR14","DOI":"10.1109\/CDC.2002.1184960"},{"issue":"10","key":"2_CR15","doi-asserted-by":"crossref","first-page":"1216","DOI":"10.1109\/12.467696","volume":"44","author":"P Semal","year":"1995","unstructured":"Semal, P.: Refinable bounds for large Markov chains. IEEE Trans. Computers 44(10), 1216\u20131222 (1995)","journal-title":"IEEE Trans. Computers"},{"issue":"3","key":"2_CR16","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/opre.27.3.616","volume":"27","author":"RF Serfozo","year":"1979","unstructured":"Serfozo, R.F.: An equivalence between continuous and discrete time Markov decision processes. Oper. Res. 27(3), 616\u2013620 (1979)","journal-title":"Oper. Res."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-540-72927-3_20","volume-title":"Learning Theory","author":"A Tewari","year":"2007","unstructured":"Tewari, A., Bartlett, P.L.: Bounded parameter Markov decision processes with average reward criterion. In: Bshouty, N.H., Gentile, C. (eds.) COLT 2007. LNCS, vol. 4539, pp. 263\u2013277. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72927-3_20"},{"issue":"2","key":"2_CR18","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1287\/moor.1060.0188","volume":"31","author":"B Roy Van","year":"2006","unstructured":"Van Roy, B.: Performance loss bounds for approximate value iteration with state aggregation. Math. Oper. Res. 31(2), 234\u2013244 (2006)","journal-title":"Math. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computer Performance Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66583-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T22:22:59Z","timestamp":1750803779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66583-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319665825","9783319665832"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66583-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}