{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T16:10:19Z","timestamp":1736007019486,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540283096"},{"type":"electronic","value":"9783540319344"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11539452_24","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T13:54:50Z","timestamp":1127829290000},"page":"293-307","source":"Crossref","is-referenced-by-count":7,"title":["Deriving Weak Bisimulation Congruences from Reduction Systems"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Bruni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-44618-4_20","volume-title":"CONCUR 2000 - Concurrency Theory","author":"R. Bruni","year":"2000","unstructured":"Bruni, R., de Frutos-Escrig, D., Mart\u00ed-Oliet, N., Montanari, U.: Bisimilarity congruences for open terms and term graphs via tile logic. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 259\u2013274. Springer, Heidelberg (2000)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1017\/S0960129501003462","volume":"12","author":"R. Bruni","year":"2002","unstructured":"Bruni, R., Meseguer, J., Montanari, U.: Symmetric and cartesian double categories as a semantic framework for tile logic. Mathematical Structures in Computer Science\u00a012, 53\u201390 (2002)","journal-title":"Mathematical Structures in Computer Science"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1017\/S1471068401000035","volume":"1","author":"R. Bruni","year":"2001","unstructured":"Bruni, R., Montanari, U., Rossi, F.: An interactive semantics of logic programming. Theory and Practice of Logic Programming\u00a01, 647\u2013690 (2001)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"2-3","key":"24_CR4","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2004.10.044","volume":"335","author":"R. Bruni","year":"2005","unstructured":"Bruni, R., Montanari, U., Sassone, V.: Observational congruences for dynamically reconfigurable tile systems. Theor. Comp. Sci.\u00a0335(2-3), 331\u2013372 (2005)","journal-title":"Theor. Comp. Sci."},{"key":"24_CR5","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1051\/ita:1999128","volume":"33","author":"A. Corradini","year":"1999","unstructured":"Corradini, A., Gadducci, F.: Rewriting on cyclic structures: Equivalence between the operational and the categorical description. Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications\u00a033, 467\u2013493 (1999)","journal-title":"Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/inco.1999.2825","volume":"156","author":"G. Ferrari","year":"2000","unstructured":"Ferrari, G., Montanari, U.: Tile formats for located and mobile systems. Inform. and Comput.\u00a0156, 173\u2013235 (2000)","journal-title":"Inform. and Comput."},{"key":"24_CR7","series-title":"Electr. Notes in Theor. Comp. Sci","volume-title":"Proc. of CTCS 1999","author":"F. Gadducci","year":"1975","unstructured":"Gadducci, F., Heckel, R., Llabr\u00e9s, M.: A bi-categorical axiomatisation of concurrent graph rewriting. In: Nickel, K. (ed.) Proc. of CTCS 1999. Electr. Notes in Theor. Comp. Sci, vol.\u00a029, Elsevier, Amsterdam (1975)"},{"key":"24_CR8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.7551\/mitpress\/5641.003.0010","volume-title":"Proof, Language and Interaction: Essays in Honour of Robin Milner","author":"F. Gadducci","year":"2000","unstructured":"Gadducci, F., Montanari, U.: The tile model. In: Proof, Language and Interaction: Essays in Honour of Robin Milner, pp. 133\u2013166. MIT Press, Cambridge (2000)"},{"key":"24_CR9","unstructured":"Jensen, O.H.: Bigraphs and weak bisimilarity. Talk at Dagstuhl Seminar 04241 (June 2004)"},{"key":"24_CR10","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and mobile processes. Technical Report 570, Computer Laboratory, University of Cambridge (2003)"},{"key":"24_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 - Concurrency Theory","author":"J. Leifer","year":"2000","unstructured":"Leifer, J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1017\/S0960129501003498","volume":"12","author":"P.A. Melli\u00e8s","year":"2002","unstructured":"Melli\u00e8s, P.A.: Double categories: A modular model of multiplicative linear logic. Mathematical Structures in Computer Science\u00a012, 449\u2013479 (2002)","journal-title":"Mathematical Structures in Computer Science"},{"key":"24_CR13","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theor. Comp. Sci.\u00a096, 73\u2013155 (1992)","journal-title":"Theor. Comp. Sci."},{"key":"24_CR14","series-title":"Nato ASI Series F","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-642-58041-3_6","volume-title":"Logic and Algebra of Specification","author":"R. Milner","year":"1993","unstructured":"Milner, R.: The polyadic \u03c0-calculus: A tutorial. In: Logic and Algebra of Specification. Nato ASI Series F, vol.\u00a094, pp. 203\u2013246. Springer, Heidelberg (1993)"},{"key":"24_CR15","series-title":"Lectures Notes in Mathematics","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/BFb0072309","volume-title":"Midwest Category Seminar","author":"P.H. Palmquist","year":"1971","unstructured":"Palmquist, P.H.: The double category of adjoint squares. In: Midwest Category Seminar. Lectures Notes in Mathematics, vol.\u00a0195, pp. 123\u2013153. Springer, Heidelberg (1971)"},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/BFb0018358","volume-title":"Category Theory and Computer Science","author":"A.J. Power","year":"1989","unstructured":"Power, A.J.: An abstract formulation for rewrite systems. 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. 300\u2013312. Springer, Heidelberg (1989)"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-18508-9_23","volume-title":"Category Theory and Computer Science","author":"D.E. Rydehard","year":"1987","unstructured":"Rydehard, D.E., Stell, E.G.: Foundations of equational deductions: A categorical treatment of equational proofs and unification algorithms. In: Pitt, D.H., Rydeheard, D.E., Poign\u00e9, A. (eds.) Category Theory and Computer Science. LNCS, vol.\u00a0283, pp. 114\u2013139. Springer, Heidelberg (1987)"},{"key":"24_CR18","first-page":"163","volume":"10","author":"V. Sassone","year":"2003","unstructured":"Sassone, V., Soboci\u0144ski, P.: Deriving bisimulation congruences using 2-categories. Nordic Journal of Computing\u00a010, 163\u2013183 (2003)","journal-title":"Nordic Journal of Computing"},{"key":"24_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(00)00309-1","volume":"274","author":"P. Sewell","year":"2004","unstructured":"Sewell, P.: From rewrite rules to bisimulation congruences. Theor. Comp. Sci.\u00a0274, 183\u2013230 (2004)","journal-title":"Theor. Comp. Sci."},{"key":"24_CR20","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/S1570-7954(96)80019-2","volume-title":"Handbook of Algebra","author":"R.H. Street","year":"1996","unstructured":"Street, R.H.: Categorical structures. In: Handbook of Algebra, vol.\u00a01, pp. 529\u2013577. North-Holland, Amsterdam (1996)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T15:42:10Z","timestamp":1736005330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11539452_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}