{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:45:44Z","timestamp":1725518744772},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874041"},{"type":"electronic","value":"9783540874058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87405-8_16","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T06:48:17Z","timestamp":1221634097000},"page":"226-241","source":"Crossref","is-referenced-by-count":2,"title":["Parallel and Sequential Independence for Borrowed Contexts"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tobias","family":"Heindel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"16_CR1","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":"16_CR2","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":"16_CR3","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., K\u00f6nig, B., Ehrig, H.: Composition and decomposition of DPO transformations with borrowed context. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozemberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 153\u2013167. Springer, Heidelberg (2006)"},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/978-3-540-40018-9_4","volume-title":"Programming Languages and Systems","author":"F. Gadducci","year":"2003","unstructured":"Gadducci, F.: Term graph rewriting and the \u03c0-calculus. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol.\u00a02895, pp. 37\u201354. Springer, Heidelberg (2003)"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-73859-6_15","volume-title":"Algebra and Coalgebra in Computer Science","author":"F. Gadducci","year":"2007","unstructured":"Gadducci, F., Lluch-Lafuente, A.: Graphical encoding of a spatial logic for the \u03c0-calculus. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 209\u2013225. Springer, Heidelberg (2007)"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11841883_13","volume-title":"Graph Transformation","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., Rozemberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 168\u2013183. Springer, Heidelberg (2006)"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1142\/9789812384720_0003","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 I: Basic concepts and double pushout approach. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformation, vol.\u00a01, pp. 163\u2013245. World Scientific, Singapore (1997)"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1017\/S0960129501003425","volume":"11","author":"A. Habel","year":"2001","unstructured":"Habel, A., M\u00fcller, J., Plump, D.: Double-pushout graph transformation revisited. Mathematical Structures in Computer Science\u00a011, 637\u2013688 (2001)","journal-title":"Mathematical Structures in Computer Science"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1051\/ita:2005028","volume":"39","author":"S. Lack","year":"2005","unstructured":"Lack, S., Soboci\u0144ski, P.: Adhesive and quasiadhesive categories. Theoretical Informatics and Applications\u00a039, 511\u2013545 (2005)","journal-title":"Theoretical Informatics and Applications"},{"key":"16_CR10","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"G. Winskel","year":"1992","unstructured":"Winskel, G., Nielsen, M.: Models for concurrency. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S. (eds.) Handbook of Logic in Computer Science, vol.\u00a04, pp. 1\u2013148. Oxford University Press, Oxford (1992)"},{"key":"16_CR11","first-page":"311","volume-title":"Logic in Computer Science","author":"V. Sassone","year":"2005","unstructured":"Sassone, V., Soboci\u0144ski, P.: Reactive systems over cospans. In: Logic in Computer Science, pp. 311\u2013320. IEEE Computer Society Press, Los Alamitos (2005)"},{"key":"16_CR12","unstructured":"Soboci\u0144ski, P.: Deriving bisimulation congruences from reduction systems. PhD thesis, BRICS, Department of Computer Science, University of Aaurhus (2004)"},{"issue":"4","key":"16_CR13","doi-asserted-by":"crossref","first-page":"357","DOI":"10.3233\/FI-1988-11404","volume":"11","author":"A.M. Rabinovich","year":"1988","unstructured":"Rabinovich, A.M., Trakhtenbrot, B.A.: Behaviour structures and nets. Foundamenta Informatica\u00a011(4), 357\u2013404 (1988)","journal-title":"Foundamenta Informatica"},{"key":"16_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/3-540-51486-4_71","volume-title":"Mathematical Foundations of Computer Science 1989","author":"R.J. Glabbeek van","year":"1989","unstructured":"van Glabbeek, R.J., Goltz, U.: Equivalence notions for concurrent systems and refinement of actions. In: Kreczmar, A., Mirkowska, G. (eds.) MFCS 1989. LNCS, vol.\u00a0379, pp. 237\u2013248. Springer, Heidelberg (1989)"},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-73859-6_9","volume-title":"Algebra and Coalgebra in Computer Science","author":"P. Baldan","year":"2007","unstructured":"Baldan, P., Corradini, A., Ehrig, H., Heckel, R., K\u00f6nig, B.: Bisimilarity and behaviour-preserving reconfiguration of open petri nets. In: Mossakowski, T., Montanari, U., Haveraaen, M. (eds.) CALCO 2007. LNCS, vol.\u00a04624, pp. 126\u2013142. Springer, Heidelberg (2007)"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/3-540-60218-6_13","volume-title":"CONCUR \u201995 Concurrency Theory","author":"M. Nielsen","year":"1995","unstructured":"Nielsen, M., Priese, L., Sassone, V.: Characterizing behavioural congruences for Petri nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.\u00a0962, pp. 175\u2013189. Springer, Heidelberg (1995)"},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"241","DOI":"10.3233\/FI-1996-263402","volume":"26","author":"A. Corradini","year":"1996","unstructured":"Corradini, A., Montanari, U., Rossi, F.: Graph processes. Fundamenta Informaticae\u00a026, 241\u2013265 (1996)","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87405-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T12:44:03Z","timestamp":1631796243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87405-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874041","9783540874058"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87405-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}