{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:27:08Z","timestamp":1725470828815},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642336539"},{"type":"electronic","value":"9783642336546"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33654-6_9","type":"book-chapter","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T03:47:41Z","timestamp":1347940061000},"page":"126-140","source":"Crossref","is-referenced-by-count":1,"title":["Borrowed Contexts for Attributed Graphs"],"prefix":"10.1007","author":[{"given":"Fernando","family":"Orejas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Artur","family":"Boronat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nikos","family":"Mylonakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"9_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.ic.2008.10.005","volume":"207","author":"F. Bonchi","year":"2009","unstructured":"Bonchi, F., Gadducci, F., K\u00f6nig, B.: Synthesising CCS bisimulation using graph rewriting. Inf. Comput.\u00a0207(1), 14\u201340 (2009)","journal-title":"Inf. Comput."},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-15928-2_9","volume-title":"Graph Transformations","author":"F. Bonchi","year":"2010","unstructured":"Bonchi, F., Gadducci, F., Monreale, G.V., Montanari, U.: Saturated LTSs for Adhesive Rewriting Systems. In: Ehrig, H., Rensink, A., Rozenberg, G., Sch\u00fcrr, A. (eds.) ICGT 2010. LNCS, vol.\u00a06372, pp. 123\u2013138. Springer, Heidelberg (2010)"},{"key":"9_CR3","unstructured":"Ehrig, H., Ehrig, K., Prange, U., Taentzer, G.: Fundamentals of Algebraic Graph Transformation. EATCS Monographs of Theoretical Comp. Sc. Springer (2006)"},{"issue":"1","key":"9_CR4","first-page":"1","volume":"74","author":"H. Ehrig","year":"2006","unstructured":"Ehrig, H., Padberg, J., Prange, U., Habel, A.: Adhesive high-level replacement systems: A new categorical framework for graph transformation. Fundamenta Informaticae\u00a074(1), 1\u201329 (2006)","journal-title":"Fundamenta Informaticae"},{"issue":"6","key":"9_CR5","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":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-642-28729-9_24","volume-title":"Foundations of Software Science and Computational Structures","author":"M. H\u00fclsbusch","year":"2012","unstructured":"H\u00fclsbusch, M., K\u00f6nig, B.: Deriving Bisimulation Congruences for Conditional Reactive Systems. In: Birkedal, L. (ed.) FOSSACS 2012. LNCS, vol.\u00a07213, pp. 361\u2013375. Springer, Heidelberg (2012)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1051\/ita:2005028","volume":"39","author":"S. Lack","year":"2005","unstructured":"Lack, S., Sobocinski, P.: Adhesive and quasiadhesive categories. Theoretical Informatics and Applications\u00a039, 511\u2013545 (2005)","journal-title":"Theoretical Informatics and Applications"},{"key":"9_CR8","unstructured":"Orejas, F., Lambers, L.: Symbolic attributed graphs for attributed graph transformation. In: Int. Coll. on Graph and Model Transformation On the Occasion of the 65th Birthday of Hartmut Ehrig (2010)"},{"issue":"3","key":"9_CR9","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1016\/j.jsc.2010.09.009","volume":"46","author":"F. Orejas","year":"2011","unstructured":"Orejas, F.: Symbolic graphs for attributed graph constraints. J. Symb. Comput.\u00a046(3), 294\u2013315 (2011)","journal-title":"J. Symb. Comput."},{"issue":"1-2","key":"9_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.3233\/FI-2012-706","volume":"118","author":"F. Orejas","year":"2012","unstructured":"Orejas, F., Lambers, L.: Lazy Graph Transformation. Fundamenta Informaticae\u00a0118(1-2), 65\u201396 (2012)","journal-title":"Fundamenta Informaticae"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol.\u00a0104, pp. 167\u2013183. Springer, Heidelberg (1981)"},{"key":"9_CR12","unstructured":"Rangel, G., K\u00f6nig, B., Ehrig, H.: Bisimulation verification for the DPO approach with borrowed contexts. ECEASST 6 (2007)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 (Extended Abstract). In: H\u00e1jek, P., Wiedermann, J. (eds.) MFCS 1995. LNCS, vol.\u00a0969, pp. 479\u2013488. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33654-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:17:57Z","timestamp":1620130677000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33654-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642336539","9783642336546"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33654-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}