{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:28:01Z","timestamp":1761611281325,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642198045"},{"type":"electronic","value":"9783642198052"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19805-2_3","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T09:05:14Z","timestamp":1300093514000},"page":"27-41","source":"Crossref","is-referenced-by-count":22,"title":["Similarity Quotients as Final Coalgebras"],"prefix":"10.1007","author":[{"given":"Paul Blain","family":"Levy","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BFb0018361","volume-title":"Category Theory and Computer Science","author":"P. Aczel","year":"1989","unstructured":"Aczel, P., Mendler, P.F.: A final coalgebra theorem. In: Dybjer, P., Pitts, A.M., Pitt, D.H., Poign\u00e9, A., Rydeheard, D.E. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0389, pp. 357\u2013365. Springer, Heidelberg (1989)"},{"doi-asserted-by":"crossref","unstructured":"Baltag, A.: A logic for coalgebraic simulation. ENTCS 33 (2000)","key":"3_CR2","DOI":"10.1016\/S1571-0661(05)80343-3"},{"issue":"1","key":"3_CR3","first-page":"47","volume":"32","author":"A. Carboni","year":"1991","unstructured":"Carboni, A., Kelly, G.M., Wood, R.J.: A 2-categorical approach to change of base and geometric morphisms I. Cah. Topologie G\u00e9om. Diff\u00e9r. Cat\u00e9goriques\u00a032(1), 47\u201395 (1991), \n                    \n                      http:\/\/www.numdam.org\/item?id=CTGDC_1991__32_1_47_0","journal-title":"Cah. Topologie G\u00e9om. Diff\u00e9r. Cat\u00e9goriques"},{"issue":"4","key":"3_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/j.ic.2005.04.005","volume":"204","author":"C. C\u00eerstea","year":"2006","unstructured":"C\u00eerstea, C.: A modular approach to defining and characterising notions of simulation. Inf. Comput.\u00a0204(4), 469\u2013502 (2006)","journal-title":"Inf. Comput."},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ic.2005.02.004","volume":"204","author":"Vincent Danos","year":"2006","unstructured":"Danos, D., Laviolette, P.: Bisimulation and cocongruence for probabilistic systems. Information and Computation 204 (2006)","journal-title":"Information and Computation"},{"unstructured":"Desharnais, J.: A logical characterization of bisimulation for labelled Markov processes. In: Proceedings of the 2nd International Workshop on Probabilistic Methods in Verification, Univ. of Birmingham Technical Report CS-99-8, pp. 33\u201348 (1999)","key":"3_CR6"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-03741-2_16","volume-title":"Algebra and Coalgebra in Computer Science","author":"I. F\u00e1bregas","year":"2009","unstructured":"F\u00e1bregas, I., de Frutos Escrig, D., Palomino, M.: Non-strongly stable orders also define interesting simulation relations. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 221\u2013235. Springer, Heidelberg (2009)"},{"key":"3_CR8","first-page":"95","volume-title":"Lecture Notes in Mathematics","author":"Peter Freyd","year":"1991","unstructured":"Freyd, P.J.: Algebraically complete categories. In: Proc. 1990 Como Category Theory Conf., Berlin. Lecture Notes in Mathematics, vol.\u00a01488, pp. 95\u2013104 (1991)"},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","volume":"100","author":"J.F. Groote","year":"1992","unstructured":"Groote, J.F., Vaandrager, F.: Structured operational semantics and bisimulation as a congruence. Information and Computation\u00a0100(2), 202\u2013260 (1992)","journal-title":"Information and Computation"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/BFb0022510","volume-title":"Mathematical Foundations of Computer Science 1980","author":"M. Hennessy","year":"1980","unstructured":"Hennessy, M., Plotkin, G.D.: A term model for CCS. In: Dembi\u0144ski, P. (ed.) MFCS 1980. LNCS, vol.\u00a088, pp. 261\u2013274. Springer, Heidelberg (1980)"},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/inco.1998.2725","volume":"145","author":"C. Hermida","year":"1998","unstructured":"Hermida, C., Jacobs, B.: Structural induction and coinduction in a fibrational setting. Information and Computation\u00a0145(2), 107\u2013152 (1998)","journal-title":"Information and Computation"},{"issue":"1-2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(98)00176-5","volume":"238","author":"W.H. Hesselink","year":"2000","unstructured":"Hesselink, W.H., Thijs, A.: Fixpoint semantics and simulation. TCS\u00a0238(1-2), 275\u2013311 (2000)","journal-title":"TCS"},{"issue":"1-2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2004.07.022","volume":"327","author":"J. Hughes","year":"2004","unstructured":"Hughes, J., Jacobs, B.: Simulations in coalgebra. TCS\u00a0327(1-2), 71\u2013108 (2004)","journal-title":"TCS"},{"issue":"6","key":"3_CR14","doi-asserted-by":"publisher","first-page":"899","DOI":"10.1214\/aop\/1176995659","volume":"5","author":"T. Kamae","year":"1977","unstructured":"Kamae, T., Krengel, U., O\u2019Brien, G.L.: Stochastic inequalities on partially ordered spaces. The Annals of Probability\u00a05(6), 899\u2013912 (1977)","journal-title":"The Annals of Probability"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Information and Computation\u00a094(1), 1\u201328 (1991)","journal-title":"Information and Computation"},{"unstructured":"Levy, P.B.: Boolean precongruences (2009) (journal submission)","key":"3_CR16"},{"issue":"1","key":"3_CR17","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. TCS\u00a0249(1), 3\u201380 (2000)","journal-title":"TCS"},{"unstructured":"Sokolova, A.: Coalgebraic analysis of probabilistic systems. Ph.D. thesis, Technische Universiteit Eindhoven (2005)","key":"3_CR18"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-03741-2_14","volume-title":"Algebra and Coalgebra in Computer Science","author":"S. Staton","year":"2009","unstructured":"Staton, S.: Relating coalgebraic notions of bisimulation. In: Kurz, A., Lenisa, M., Tarlecki, A. (eds.) CALCO 2009. LNCS, vol.\u00a05728, pp. 191\u2013205. Springer, Heidelberg (2009)"},{"key":"3_CR20","first-page":"148","volume-title":"Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science","author":"I. Ulidowski","year":"1992","unstructured":"Ulidowski, I.: Equivalences on observable processes. In: Scedrov, A. (ed.) Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science, pp. 148\u2013161. IEEE Computer Society Press, Santa Cruz (June 1992)"},{"doi-asserted-by":"crossref","unstructured":"de Vink, E.P., Rutten, J.J.M.M.: Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoretical Computer Science 221 (1999)","key":"3_CR21","DOI":"10.1016\/S0304-3975(99)00035-3"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S1571-0661(05)80356-1","volume":"33","author":"James Worrell","year":"2000","unstructured":"Worrell, J.: Coinduction for recursive data types: partial orders, metric spaces and \u03c9-categories. ENTCS\u00a033 (2000)","journal-title":"Electronic Notes in Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19805-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:09:10Z","timestamp":1558422550000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19805-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198045","9783642198052"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19805-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}