{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T14:40:40Z","timestamp":1737384040098,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"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_3","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T11:37:02Z","timestamp":1187696222000},"page":"36-39","source":"Crossref","is-referenced-by-count":0,"title":["Deriving Bisimulation Congruences with Borrowed Contexts"],"prefix":"10.1007","author":[{"given":"Barbara","family":"K\u00f6nig","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/11841883_12","volume-title":"Graph Transformations","author":"P. Baldan","year":"2006","unstructured":"Baldan, P., Ehrig, H., K\u00f6nig, B.: Composition and decomposition of DPO transformations with borrowed context. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 153\u2013167. Springer, Heidelberg (2006)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11841883_13","volume-title":"Graph Transformations","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., Gadducci, F., K\u00f6nig, B.: Process bisimulation via a graphical encoding. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 168\u2013183. Springer, Heidelberg (2006)"},{"key":"3_CR3","volume-title":"Proc. of LICS 2006","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., K\u00f6nig, B., Montanari, U.: Saturated semantics for reactive systems. In: Proc. of LICS 2006, IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Corradini, A., Montanari, U., Rossi, F., Ehrig, H., Heckel, R., L\u00f6we, M.: Algebraic approaches to graph transformation\u2014part\u00a0I: Basic concepts and double pushout approach. In: Rozenberg, G., (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01: Foundations, ch. 3. World Scientific (1997)","DOI":"10.1142\/9789812384720_0003"},{"key":"3_CR5","first-page":"167","volume-title":"Proc. 14th IEEE Symp. on Switching and Automata Theory","author":"H. Ehrig","year":"1973","unstructured":"Ehrig, H., Pfender, M., Schneider, H.: Graph grammars: An algebraic approach. In: Proc. 14th IEEE Symp. on Switching and Automata Theory, pp. 167\u2013180. IEEE Computer Society Press, Los Alamitos (1973)"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1133","DOI":"10.1017\/S096012950600569X","volume":"16","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Mathematical Structures in Computer Science\u00a016(6), 1133\u20131163 (2006)","journal-title":"Mathematical Structures in Computer Science"},{"key":"3_CR7","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":"3_CR8","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":"3_CR9","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 Press, New York (2003)"},{"key":"3_CR10","unstructured":"K\u00f6nig, B.: A graph rewriting semantics for the polyadic \u03c0-calculus. In: Proc. of GT-VMT \u201900 (Workshop on Graph Transformation and Visual Modeling Techniques), pp. 451\u2013458. Carleton Scientific (2000)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. RAIRO \u2013 Theoretical Informatics and Applications\u00a039(3) (2005)","DOI":"10.1051\/ita:2005028"},{"key":"3_CR12","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":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2000)"},{"key":"3_CR14","volume-title":"Communicating and Mobile Systems: the \u03c0-Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-Calculus. Cambridge University Press, Cambridge (1999)"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"R. Milner","year":"1992","unstructured":"Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) Automata, Languages and Programming. LNCS, vol.\u00a0623, Springer, Heidelberg (1992)"},{"key":"3_CR16","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":"3_CR17","unstructured":"Rangel, G., K\u00f6nig, B., Ehrig, H.: Bisimulation verification for the DPO approach with borrowed contexts. In: Proc. of GT-VMT 2007 (Workshop on Graph Transformation and Visual Modeling Techniques), Electronic Communications of the EASST (to appear)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Rozenberg, G.(ed.): Handbook of Graph Grammars and Computing by Graph Transformation, Foundations, vol. 1 World Scientific (1997)","DOI":"10.1142\/3303"},{"key":"3_CR19","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":"3_CR20","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., Soboci\u0144ski, P.: Deriving bisimulation congruences: 2-categories vs precategories. In: Gordon, A.D. (ed.) ETAPS 2003 and FOSSACS 2003. LNCS, vol.\u00a02620, pp. 409\u2013424. Springer, Heidelberg (2003)"},{"key":"3_CR21","first-page":"311","volume-title":"Proc. of LICS 2005","author":"V. Sassone","year":"2005","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: Proc. of LICS 2005, pp. 311\u2013320. IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"1-2","key":"3_CR22","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","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_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T13:58:53Z","timestamp":1737381533000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73859-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738572"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73859-6_3","relation":{},"subject":[]}}