{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T20:33:02Z","timestamp":1759177982973,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030003883"},{"type":"electronic","value":"9783030003890"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/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-030-00389-0_6","type":"book-chapter","created":{"date-parts":[[2018,9,19]],"date-time":"2018-09-19T19:12:43Z","timestamp":1537384363000},"page":"78-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Long-Term Values in Markov Decision Processes, (Co)Algebraically"],"prefix":"10.1007","author":[{"given":"Frank M. V.","family":"Feys","sequence":"first","affiliation":[]},{"given":"Helle Hvid","family":"Hansen","sequence":"additional","affiliation":[]},{"given":"Lawrence S.","family":"Moss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,20]]},"reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1017\/S0960129515000365","volume":"27","author":"S Abramsky","year":"2017","unstructured":"Abramsky, S., Winschel, V.: Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting. Math. Struct. Comput. Sci. 27(5), 751\u2013761 (2017)","journal-title":"Math. Struct. Comput. Sci."},{"key":"6_CR2","unstructured":"Baldan, P., Bonchi, F., Kerstan, H., K\u00f6nig, B.: Behavioral metrics via functor lifting. In: 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, FSTTCS 2014, pp. 403\u2013415 (2014)"},{"key":"6_CR3","unstructured":"Bartels, F.: On Generalised Coinduction and Probabilistic Specification Formats. Ph.D. thesis, Vrije Universiteit Amsterdam (2004)"},{"key":"6_CR4","volume-title":"Dynamic Programming","author":"R Bellman","year":"1957","unstructured":"Bellman, R.: Dynamic Programming, 1st edn. Princeton University Press, Princeton (1957)","edition":"1"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.ic.2005.08.005","volume":"204","author":"V Capretta","year":"2006","unstructured":"Capretta, V., Uustalu, T., Vene, V.: Recursive coalgebras from comonads. Inf. Comp. 204, 437\u2013468 (2006)","journal-title":"Inf. Comp."},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-10452-7_7","volume-title":"Formal Methods: Foundations and Applications","author":"V Capretta","year":"2009","unstructured":"Capretta, V., Uustalu, T., Vene, V.: Corecursive algebras: a study of general structured corecursion. In: Oliveira, M.V.M., Woodcock, J. (eds.) SBMF 2009. LNCS, vol. 5902, pp. 84\u2013100. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10452-7_7"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1137\/1009030","volume":"9","author":"EV Denardo","year":"1967","unstructured":"Denardo, E.V.: Contraction mappings in the theory underlying dynamic programming. SIAM Rev. 9(2), 165\u2013177 (1967)","journal-title":"SIAM Rev."},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1006\/inco.2001.2962","volume":"179","author":"J Desharnais","year":"2002","unstructured":"Desharnais, J., Edalat, A., Panangaden, P.: Bisimulation for labelled markov processes. Inf. Comput. 179(2), 163\u2013193 (2002)","journal-title":"Inf. Comput."},{"key":"6_CR9","unstructured":"Ferns, N., Panangaden, P., Precup, D.: Metrics for finite markov decision processes. In: Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence, UAI 2004, pp. 162\u2013169. AUAI Press, Arlington (2004). http:\/\/dl.acm.org\/citation.cfm?id=1036843.1036863"},{"issue":"3","key":"6_CR10","first-page":"419","volume":"70","author":"AL Gibbs","year":"2002","unstructured":"Gibbs, A.L., Su, F.E.: On choosing and bounding probability metrics. Int. Stat. Rev.\/Revue Internationale de Statistique 70(3), 419\u2013435 (2002)","journal-title":"Int. Stat. Rev.\/Revue Internationale de Statistique"},{"key":"6_CR11","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0092872","volume-title":"Categorical Aspects of Topology and Analysis","author":"M Giry","year":"1982","unstructured":"Giry, M.: A categorical approach to probability theory. In: Banaschewski, B. (ed.) Categorical Aspects of Topology and Analysis. LNM, vol. 915, pp. 68\u201385. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0092872"},{"key":"6_CR12","volume-title":"Dynamic Programming and Markov Processes","author":"RA Howard","year":"1960","unstructured":"Howard, R.A.: Dynamic Programming and Markov Processes. The M.I.T. Press, Cambridge, MA (1960)"},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1016\/j.ic.2005.03.006","volume":"204","author":"B Jacobs","year":"2006","unstructured":"Jacobs, B.: Distributive laws for the coinductive solution of recursive equations. Inf. Comput. 204(4), 561\u2013587 (2006)","journal-title":"Inf. Comput."},{"issue":"5","key":"6_CR14","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1016\/j.jcss.2014.12.005","volume":"81","author":"B Jacobs","year":"2015","unstructured":"Jacobs, B., Silva, A., Sokolova, A.: Trace semantics via determinization. J. Comput. Syst. Sci. 81(5), 859\u2013879 (2015). 11th International Workshop on Coalgebraic Methods in Computer Science, CMCS 2012 (Selected Papers)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1112\/blms\/7.3.294","volume":"7","author":"PT Johnstone","year":"1975","unstructured":"Johnstone, P.T.: Adjoint lifting theorems for categories of algebras. Bull. Lond. Math. Soc. 7, 294\u2013297 (1975)","journal-title":"Bull. Lond. Math. Soc."},{"issue":"38","key":"6_CR16","doi-asserted-by":"publisher","first-page":"5043","DOI":"10.1016\/j.tcs.2011.03.023","volume":"412","author":"B Klin","year":"2011","unstructured":"Klin, B.: Bialgebras for structural operational semantics: an introduction. Theor. Comput. Sci. 412(38), 5043\u20135069 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-5(3:10)2009","volume":"5","author":"D Kozen","year":"2009","unstructured":"Kozen, D.: Coinductive proof principles for stochastic processes. Log. Methods Comput. Sci. 5, 1\u201319 (2009)","journal-title":"Log. Methods Comput. Sci."},{"key":"6_CR18","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4721-8","volume-title":"Categories for the Working Mathematician","author":"S Mac Lane","year":"1978","unstructured":"Mac Lane, S.: Categories for the Working Mathematician. GTM, vol. 5. Springer, New York (1978). https:\/\/doi.org\/10.1007\/978-1-4757-4721-8"},{"issue":"1","key":"6_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.05.003","volume":"196","author":"S Milius","year":"2005","unstructured":"Milius, S.: Completely iterative algebras and completely iterative monads. Inf. Comput. 196(1), 1\u201341 (2005)","journal-title":"Inf. Comput."},{"key":"6_CR20","unstructured":"Moore, A.W.: Markov Systems, Markov Decision Processes, and Dynamic Programming (2002). lecture slides available at https:\/\/www.autonlab.org\/tutorials"},{"key":"6_CR21","volume-title":"Metric Spaces","author":"M \u00d3\u2019Searc\u00f3id","year":"2006","unstructured":"\u00d3\u2019Searc\u00f3id, M.: Metric Spaces. Springer, London (2006)"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-03741-2_22","volume-title":"Algebra and Coalgebra in Computer Science","author":"D Pavlovic","year":"2009","unstructured":"Pavlovic, D.: A semantical approach to equilibria and rationality. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol. 5728, pp. 317\u2013334. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03741-2_22"},{"key":"6_CR23","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"2014","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley, Hoboken (2014)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Ruozzi, N., Kozen, D.: Applications of metric coinduction. Logical Methods in Computer Science, 5 (2009)","DOI":"10.2168\/LMCS-5(3:10)2009"},{"issue":"1","key":"6_CR25","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J Rutten","year":"2000","unstructured":"Rutten, J.: Universal coalgebra: a theory of systems. Theor. Comput. Sci. 249(1), 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-9(1:9)2013","volume":"9","author":"A Silva","year":"2013","unstructured":"Silva, A., Bonchi, F., Bonsangue, M., Rutten, J.: Generalizing determinization from automata to coalgebras. Log. Methods Comput. Sci. 9, 1\u201327 (2013)","journal-title":"Log. Methods Comput. Sci."},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.entcs.2011.09.027","volume":"276","author":"A Silva","year":"2011","unstructured":"Silva, A., Sokolova, A.: Sound and complete axiomatization of trace semantics for probabilistic systems. Electron. Notes Theor. Comput. Sci. 276, 291\u2013311 (2011). https:\/\/doi.org\/10.1016\/j.entcs.2011.09.027","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"38","key":"6_CR28","doi-asserted-by":"publisher","first-page":"5095","DOI":"10.1016\/j.tcs.2011.05.008","volume":"412","author":"A Sokolova","year":"2011","unstructured":"Sokolova, A.: Probabilistic systems coalgebraically. Theor. Comput. Sci. 412(38), 5095\u20135110 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2011.05.008","journal-title":"Theor. Comput. Sci."},{"key":"6_CR29","volume-title":"Optimal Transport, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]","author":"C Villani","year":"2009","unstructured":"Villani, C.: Optimal Transport, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 338. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Coalgebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-00389-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:03:00Z","timestamp":1663545780000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-00389-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030003883","9783030003890"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-00389-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"20 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CMCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Coalgebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 April 2018","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":"cmcs2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.coalg.org\/cmcs18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}