{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:13:50Z","timestamp":1725491630230},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738572"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73859-6_22","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:37:02Z","timestamp":1187681822000},"page":"327-341","source":"Crossref","is-referenced-by-count":4,"title":["Applications of Metric Coinduction"],"prefix":"10.1007","author":[{"given":"Dexter","family":"Kozen","sequence":"first","affiliation":[]},{"given":"Nicholas","family":"Ruozzi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","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.\u00a0249, 3\u201380 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Fiore, M.P.: A coinduction principle for recursive data types based on bisimulation. In: Proc. 8th Conf. Logic in Computer Science (LICS 1993), pp. 110\u2013119 (1993)","DOI":"10.1109\/LICS.1993.287595"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1109\/LICS.2006.18","volume-title":"Proc. 21st Symp. Logic in Computer Science (LICS 2006)","author":"D. Kozen","year":"2006","unstructured":"Kozen, D.: Coinductive proof principles for stochastic processes. In: Alur, R. (ed.) Proc. 21st Symp. Logic in Computer Science (LICS 2006), pp. 359\u2013366. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"22_CR4","volume-title":"An Introduction to Probability Theory and its Applications","author":"W. Feller","year":"1950","unstructured":"Feller, W.: An Introduction to Probability Theory and its Applications, vol.\u00a01. Wiley, Chichester (1950)"},{"key":"22_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511613586","volume-title":"Finite Markov Chains and Algorithmic Applications","author":"O. H\u00e4ggstr\u00f6m","year":"2002","unstructured":"H\u00e4ggstr\u00f6m, O.: Finite Markov Chains and Algorithmic Applications. Cambridge University Press, Cambridge (2002)"},{"key":"22_CR6","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"22_CR7","series-title":"Texts in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3124-8","volume-title":"Markov Chains, Gibbs Fields, Monte Carlo Simulation and Queues","author":"P. Br\u00e9maud","year":"1999","unstructured":"Br\u00e9maud, P.: Markov Chains, Gibbs Fields, Monte Carlo Simulation and Queues. Texts in Applied Mathematics. Springer, Heidelberg (1999)"},{"key":"22_CR8","volume-title":"Nonnegative Matrices","author":"H. Minc","year":"1988","unstructured":"Minc, H.: Nonnegative Matrices. John Wiley, Chichester (1988)"},{"key":"22_CR9","volume-title":"Linear Operators: Part I: General Theory","author":"N. Dunford","year":"1957","unstructured":"Dunford, N., Schwartz, J.T.: Linear Operators: Part I: General Theory. John Wiley, Chichester (1957)"},{"issue":"2","key":"22_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1137\/1009030","volume":"9","author":"E.V. Denardo","year":"1967","unstructured":"Denardo, E.V.: Contraction mappings in the theory underlying dynamic programming. SIAM Review\u00a09(2), 165\u2013177 (1967)","journal-title":"SIAM Review"},{"key":"22_CR11","unstructured":"Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes, vol.\u00a014. Stanford University (1988)"},{"key":"22_CR12","unstructured":"Barwise, J., Moss, L.: Vicious Circles: On the Mathematics of Non-Wellfounded Phenomena. CSLI Lecture Notes, vol.\u00a060. Center for the Study of Language and Information (CSLI), Stanford University (1996)"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0304-3975(83)90059-2","volume":"25","author":"B. Courcelle","year":"1983","unstructured":"Courcelle, B.: Fundamental properties of infinite trees. Theor. Comput. Sci.\u00a025, 95\u2013169 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"22_CR14","volume-title":"Markov Chains: Theory and Applications","author":"D. Isaacson","year":"1976","unstructured":"Isaacson, D., Madsen, R.: Markov Chains: Theory and Applications. John Wiley and Sons, Chichester (1976)"}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73859-6_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:16:52Z","timestamp":1605745012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73859-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738572"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73859-6_22","relation":{},"subject":[]}}