{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:53:41Z","timestamp":1762458821400,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212980"},{"type":"electronic","value":"9783540247272"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24727-2_12","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:06:41Z","timestamp":1280761601000},"page":"151-166","source":"Crossref","is-referenced-by-count":34,"title":["Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting"],"prefix":"10.1007","author":[{"given":"Hartmut","family":"Ehrig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"K\u00f6nig","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/3-540-44929-9_31","volume-title":"Theoretical Computer Science: Exploring New Frontiers of Theoretical Informatics","author":"R. Bruni","year":"2000","unstructured":"Bruni, R., Montanari, U., Sassone, V.: Open ended systems, dynamic bisimulation and tile logic. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, p. 440. Springer, Heidelberg (2000)"},{"key":"12_CR2","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"A. Corradini","year":"1997","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation\u2014part I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation,Foundations, ch.3, vol.1. World Scientific, Singapore (1997)"},{"key":"12_CR3","first-page":"72","volume":"78","author":"H. Ehrig","year":"2002","unstructured":"Ehrig, H.: Bigraphs meet double pushouts. EATCS Bulletin\u00a078, 72\u201385 (2002)","journal-title":"EATCS Bulletin"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1142\/9789812814951_0006","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Concurrency, Parallellism, and Distribution, ch.6","author":"H. Ehrig","year":"1999","unstructured":"Ehrig, H., Gajewsky, M., Parisi-Presicce, F.: High-level replacement systems with applications to algebraic specifications and Petri nets. In: Ehrig, H., Kreowski, H.-J., Montanari, U., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, Concurrency, Parallellism, and Distribution, ch. 6, vol.\u00a03, pp. 341\u2013400. World Scientific, Singapore (1999)"},{"key":"12_CR5","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, ch.4","author":"H. Ehrig","year":"1997","unstructured":"Ehrig, H., Heckel, R., Korff, M., L\u00f6we, M., Ribeiro, L., Wagner, A., Corradini, A.: Algebraic approaches to graph transformation\u2014part II: Single pushout approach and comparison with double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, ch. 4, vol.\u00a01, World Scientific, Singapore (1997)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting. Technical report, Universit\u00e4t Stuttgart (2004) (to appear)","DOI":"10.1007\/978-3-540-24727-2_12"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-64299-4_36","volume-title":"Recent Trends in Algebraic Development Techniques","author":"F. Gadducci","year":"1998","unstructured":"Gadducci, F., Heckel, R.: An inductive view of graph transformation. In: Parisi-Presicce, F. (ed.) WADT 1997. LNCS, vol.\u00a01376, pp. 223\u2013237. Springer, Heidelberg (1998)"},{"key":"12_CR8","series-title":"Electronic Notes in Computer Science","volume-title":"Proceedings of the 17th MFPS","author":"F. Gadducci","year":"2001","unstructured":"Gadducci, F., Montanari, U.: A concurrent graph semantics for mobile ambients. In: Brookes, S., Mislove, M. (eds.) Proceedings of the 17th MFPS. Electronic Notes in Computer Science, vol.\u00a045, Elsevier Science, Amsterdam (2001)"},{"issue":"2","key":"12_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(01)00362-0","volume":"285","author":"F. Gadducci","year":"2002","unstructured":"Gadducci, F., Montanari, U.: Comparing logics for rewriting: Rewriting logic, action calculi and tile logic. Theoretical Computer Science\u00a0285(2), 319\u2013358 (2002)","journal-title":"Theoretical Computer Science"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/604131.604135","volume-title":"Proc. of POPL 2003","author":"O.H. Jensen","year":"2003","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and transitions. In: Proc. of POPL 2003, pp. 38\u201349. ACM, New York (2003)"},{"key":"12_CR11","unstructured":"K\u00f6nig, B.: A graph rewriting semantics for the polyadic \u03c0-calculus. In: Workshop on Graph Transformation and Visual Modeling Techniques, ICALP Workshops 2000, Geneva, Switzerland, pp. 451\u2013458. Carleton Scientific (2000)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-540-24727-2_20","volume-title":"Foundations of Software Science and Computation Structures","author":"S. Lack","year":"2004","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive categories. In: Walukiewicz, I. (ed.) FOSSACS 2004. LNCS, vol.\u00a02987, pp. 273\u2013288. Springer, Heidelberg (2004)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Leifer, J.J.: Operational congruences for reactive systems. PhD thesis, University of Cambridge Computer Laboratory (September 2001)","DOI":"10.1007\/3-540-44618-4_19"},{"key":"12_CR14","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.J. Leifer","year":"2000","unstructured":"Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, p. 243. Springer, Heidelberg (2000)"},{"key":"12_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-9839-7","volume-title":"Categories for the Working Mathematician","author":"S.M. Lane","year":"1971","unstructured":"Lane, S.M.: Categories for the Working Mathematician. Springer, Heidelberg (1971)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/3-540-44685-0_2","volume-title":"CONCUR 2001 - Concurrency Theory","author":"R. Milner","year":"2001","unstructured":"Milner, R.: Bigraphical reactive systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 16\u201335. Springer, Heidelberg (2001)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Proc. of ICALP 1992. LNCS, vol.\u00a0623. Springer, Heidelberg (1992)","DOI":"10.1007\/3-540-55719-9_114"},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"171","DOI":"10.3233\/FI-1992-16206","volume":"16","author":"U. Montanari","year":"1992","unstructured":"Montanari, U., Sassone, V.: Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae\u00a016, 171\u2013196 (1992)","journal-title":"Fundamenta Informaticae"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Montanari, U., Pistore, M.: Concurrent semantics for the \u03c0-calculus. Electronic Notes in Theoretical Computer Science\u00a01 (1995)","DOI":"10.1016\/S1571-0661(04)00024-6"},{"key":"12_CR20","doi-asserted-by":"publisher","DOI":"10.1142\/9789812384720","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation, Foundations","author":"G. Rozenberg","year":"1997","unstructured":"Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol.\u00a01. World Scientific, Singapore (1997)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/3-540-60246-1_153","volume-title":"Mathematical Foundations of Computer Science 1995","author":"D. Sangiorgi","year":"1995","unstructured":"Sangiorgi, D.: On the proof method for bisimulation. In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 479\u2013488. Springer, Heidelberg (1995)"},{"key":"12_CR22","volume-title":"The \u03c0-calculus\u2014A Theory of Mobile Processes","author":"D. Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus\u2014A Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-36576-1_26","volume-title":"Foundations of Software Science and Computational Structures","author":"V. Sassone","year":"2003","unstructured":"Sassone, V., Sobocinski, P.: Deriving bisimulation congruences: 2-categories vs precategories. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, pp. 409\u2013424. Springer, Heidelberg (2003)"},{"issue":"1-2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0304-3975(00)00309-1","volume":"274","author":"P. Sewell","year":"2002","unstructured":"Sewell, P.: From rewrite rules to bisimulation congruences. Theoretical Computer Science\u00a0274(1-2), 183\u2013230 (2002)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24727-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T18:01:31Z","timestamp":1740333691000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24727-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212980","9783540247272"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24727-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}