{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T06:57:11Z","timestamp":1760079431160,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037405"},{"type":"electronic","value":"9783642037412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03741-2_14","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:20:01Z","timestamp":1252938001000},"page":"191-205","source":"Crossref","is-referenced-by-count":15,"title":["Relating Coalgebraic Notions of Bisimulation"],"prefix":"10.1007","author":[{"given":"Sam","family":"Staton","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1006\/inco.1991.9999","volume":"92","author":"S. Abramsky","year":"1991","unstructured":"Abramsky, S.: A domain equation for bisimulation. Inform. and Comput.\u00a092, 161\u2013218 (1991)","journal-title":"Inform. and Comput."},{"key":"14_CR2","unstructured":"Abramsky, S.: A cook\u2019s tour of the finitary non-well-founded sets. In: We Will Show Them! Essays in Honour of Dov Gabbay, vol.\u00a01, pp. 1\u201318 (2005)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Aczel, P., Mendler, N.: A final coalgebra theorem. In: Proc. of CTCS 1989, pp. 357\u2013365 (1989)","DOI":"10.1007\/BFb0018361"},{"issue":"8","key":"14_CR4","first-page":"157","volume":"14","author":"J. Ad\u00e1mek","year":"2005","unstructured":"Ad\u00e1mek, J.: Introduction to coalgebra. Theory Appl. of Categ.\u00a014(8), 157\u2013199 (2005)","journal-title":"Theory Appl. of Categ."},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"767","DOI":"10.2178\/jsl\/1191333841","volume":"72","author":"B. Berg van den","year":"2007","unstructured":"van den Berg, B., Marchi, F.D.: Models of non-well-founded sets via an indexed final coalgebra theorem. J. Symbolic Logic\u00a072(3), 767\u2013791 (2007)","journal-title":"J. Symbolic Logic"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Bezhanishvili, N., Fontaine, G., Venema, Y.: Vietoris bisimulations. J. Logic Comput. (2008) (to appear)","DOI":"10.1093\/logcom\/exn091"},{"key":"14_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525865","volume-title":"Handbook of Categorical Algebra","author":"F. Borceux","year":"1994","unstructured":"Borceux, F.: Handbook of Categorical Algebra. Cambridge University Press, Cambridge (1994)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1018","DOI":"10.1007\/11523468_82","volume-title":"Automata, Languages and Programming","author":"F. Breugel van","year":"2005","unstructured":"van Breugel, F., Hermida, C., Makkai, M., Worrell, J.B.: An accessible approach to behavioural pseudometrics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1018\u20131030. Springer, Heidelberg (2005)"},{"key":"14_CR9","unstructured":"Carboni, A., Kelly, G.M., Wood, R.J.: A 2-categorical approach to geometric morphisms I. Cah. Topol. G\u00e9om. Diff\u00e9r. Cat\u00e9g. XXXII(1), 47\u201395 (1991)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0022-4049(93)90035-R","volume":"83","author":"A. Carboni","year":"1993","unstructured":"Carboni, A., Lack, S., Walters, R.F.C.: Introduction to extensive and distributive categories. J. Pure Appl. Algebra\u00a083, 145\u2013158 (1993)","journal-title":"J. Pure Appl. Algebra"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"43","DOI":"10.2140\/pjm.1979.82.43","volume":"82","author":"P. Cousot","year":"1979","unstructured":"Cousot, P., Cousot, R.: Constructive versions of Tarski\u2019s fixed point theorems. Pacific J. Math.\u00a082(1), 43\u201357 (1979)","journal-title":"Pacific J. Math."},{"issue":"4","key":"14_CR12","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ic.2005.02.004","volume":"204","author":"V. Danos","year":"2006","unstructured":"Danos, V., Desharnais, J., Laviolette, F., Panangaden, P.: Bisimulation and cocongruence for probabilistic systems. Inform. and Comput.\u00a0204(4), 503\u2013523 (2006)","journal-title":"Inform. and Comput."},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45931-6_10","volume-title":"Foundations of Software Science and Computation Structures","author":"G. Ferrari","year":"2002","unstructured":"Ferrari, G., Montanari, U., Pistore, M.: Minimizing transition systems for name passing calculi: A co-algebraic formulation. In: Nielsen, M., Engberg, U. (eds.) FOSSACS 2002. LNCS, vol.\u00a02303, pp. 129\u2013158. Springer, Heidelberg (2002)"},{"issue":"4","key":"14_CR14","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ic.2005.08.004","volume":"204","author":"M.P. Fiore","year":"2006","unstructured":"Fiore, M.P., Staton, S.: Comparing operational models of name-passing process calculi. Inform. and Comput.\u00a0204(4), 435\u2013678 (2006)","journal-title":"Inform. and Comput."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Fiore, M.P., Staton, S.: A congruence rule format for name-passing process calculi from mathematical structural operational semantics. In: Proc. of LICS 2006, pp. 49\u201358 (2006)","DOI":"10.1109\/LICS.2006.7"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Fiore, M.P., Turi, D.: Semantics of name and value passing (extended abstract). In: Proc. of LICS 2001, pp. 93\u2013104 (2001)","DOI":"10.1109\/LICS.2001.932486"},{"key":"14_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-540-89439-1_11","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M.J. Gabbay","year":"2008","unstructured":"Gabbay, M.J., Hofmann, M.: Nominal renaming sets. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 158\u2013173. Springer, Heidelberg (2008)"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s001650200016","volume":"13","author":"M.J. Gabbay","year":"2001","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing\u00a013, 341\u2013363 (2001)","journal-title":"Formal Aspects of Computing"},{"issue":"2\u20133","key":"14_CR19","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10990-006-8749-3","volume":"19","author":"F. Gadducci","year":"2006","unstructured":"Gadducci, F., Miculan, M., Montanari, U.: About permutation algebras (pre)sheaves and named sets. Higher-Order Symb. Comput.\u00a019(2\u20133), 283\u2013304 (2006)","journal-title":"Higher-Order Symb. Comput."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Ghani, N., Yemane, K., Victor, B.: Relationally staged computations in calculi of mobile processes. In: Proc. of CMCS 2004, pp. 105\u2013120 (2004)","DOI":"10.1016\/j.entcs.2004.02.027"},{"key":"14_CR21","first-page":"135","volume":"45","author":"H.P. Gumm","year":"2001","unstructured":"Gumm, H.P.: Functors for coalgebras. Algebra Univers\u00a045, 135\u2013147 (2001)","journal-title":"Algebra Univers"},{"issue":"2","key":"14_CR22","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. Inform. and Comput.\u00a0145(2), 107\u2013152 (1998)","journal-title":"Inform. and Comput."},{"key":"14_CR23","first-page":"222","volume":"62","author":"B. Jacobs","year":"1997","unstructured":"Jacobs, B., Rutten, J.: A tutorial on coalgebras and coinduction. EATCS Bulletin\u00a062, 222\u2013259 (1997)","journal-title":"EATCS Bulletin"},{"issue":"1-2","key":"14_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(00)00124-9","volume":"260","author":"P. Johnstone","year":"2001","unstructured":"Johnstone, P., Power, J., Tsujishita, T., Watanabe, H., Worrell, J.: On the structure of categories of coalgebras. Theoret. Comput. Sci.\u00a0260(1-2), 87\u2013117 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR25","volume-title":"Sketches of an Elephant: A Topos Theory Compendium","author":"P.T. Johnstone","year":"2002","unstructured":"Johnstone, P.T.: Sketches of an Elephant: A Topos Theory Compendium. Oxford University Press, Oxford (2002)"},{"key":"14_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511752483","volume-title":"Algebraic Set Theory","author":"A. Joyal","year":"1995","unstructured":"Joyal, A., Moerdijk, I.: Algebraic Set Theory. Cambridge University Press, Cambridge (1995)"},{"issue":"1\u20132","key":"14_CR27","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0022-4049(93)90092-8","volume":"89","author":"G.M. Kelly","year":"1993","unstructured":"Kelly, G.M., Power, A.J.: Adjunctions whose counits are coequalizers, and presentations of finitary enriched monads. J. Pure Appl. Algebra\u00a089(1\u20132), 163\u2013179 (1993)","journal-title":"J. Pure Appl. Algebra"},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.jlap.2004.03.005","volume":"61","author":"B. Klin","year":"2004","unstructured":"Klin, B.: Adding recursive constructs to bialgebraic semantics. J. Log. Algebr. Program.\u00a061, 259\u2013286 (2004)","journal-title":"J. Log. Algebr. Program."},{"issue":"1-2","key":"14_CR29","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.tcs.2004.07.023","volume":"327","author":"C. Kupke","year":"2004","unstructured":"Kupke, C., Kurz, A., Venema, Y.: Stone coalgebras. Theoret. Comput. Sci.\u00a0327(1-2), 109\u2013134 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR30","unstructured":"Kurz, A.: Logics for Coalgebras and Applications to Computer Science. PhD thesis, Ludwig-Maximilians-Universit\u00e4t M\u00fcnchen (2000)"},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-31982-5_11","volume-title":"Foundations of Software Science and Computational Structures","author":"M. Miculan","year":"2005","unstructured":"Miculan, M., Yemane, K.: A unifying model of variables and names. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 170\u2013186. Springer, Heidelberg (2005)"},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"key":"14_CR33","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R.: Calculi for synchrony and asynchrony. Theoret. Comput. Sci.\u00a025, 267\u2013310 (1983)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"14_CR34","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, I and II. Inform. and Comput.\u00a0100(1), 1\u201377 (1992)","journal-title":"Inform. and Comput."},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Plotkin, G.D.: Bialgebraic semantics and recursion (extended abstract). In: Proc. of CMCS 2001. Electron. Notes Theor. Comput. Sci, vol.\u00a044(1), pp. 1\u20134 (2001)","DOI":"10.1016\/S1571-0661(04)80914-9"},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Rutten, J.J.M.M.: Relators and metric bisimulations. In: Proc. of CMCS 1998. Electron. Notes Theor. Comput. Sci, vol.\u00a011 (1998)","DOI":"10.1016\/S1571-0661(04)00063-5"},{"issue":"1","key":"14_CR37","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(00)00056-6","volume":"249","author":"J.J.M.M. Rutten","year":"2000","unstructured":"Rutten, J.J.M.M.: Universal coalgebra: a theory of systems. Theoret. Comput. Sci.\u00a0249(1), 3\u201380 (2000)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"14_CR38","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the \u03c0-calculus. Acta Inform\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Inform"},{"key":"14_CR39","volume-title":"The \u03c0-calculus: a theory of mobile processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a theory of mobile processes. Cambridge University Press, Cambridge (2001)"},{"key":"14_CR40","unstructured":"Staton, S.: Name-passing process calculi: operational models and structural operational semantics. PhD thesis, University of Cambridge (2007)"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Staton, S.: General structural operational semantics through categorical logic. In: Proc. of LICS 2008, pp. 166\u2013177 (2008)","DOI":"10.1109\/LICS.2008.43"},{"key":"14_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11548133_25","volume-title":"Algebra and Coalgebra in Computer Science","author":"I.D. Viglizzo","year":"2005","unstructured":"Viglizzo, I.D.: Final sequences and final coalgebras for measurable spaces. In: Fiadeiro, J.L., Harman, N.A., Roggenbach, M., Rutten, J. (eds.) CALCO 2005. LNCS, vol.\u00a03629, pp. 395\u2013407. Springer, Heidelberg (2005)"},{"key":"14_CR43","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0304-3975(99)00035-3","volume":"221","author":"E.P. Vink de","year":"1999","unstructured":"de Vink, E.P., Rutten, J.J.M.M.: Bisimulation for probabilistic transition systems: a coalgebraic approach. Theoret. Comput. Sci.\u00a0221, 271\u2013293 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"14_CR44","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.tcs.2004.12.009","volume":"338","author":"J. Worrell","year":"2005","unstructured":"Worrell, J.: On the final sequence of a finitary set functor. Theoret. Comput. Sci.\u00a0338, 184\u2013199 (2005)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Algebra and Coalgebra in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03741-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T04:09:44Z","timestamp":1739333384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03741-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037405","9783642037412"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03741-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}