{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:28:23Z","timestamp":1742912903774,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031098420"},{"type":"electronic","value":"9783031098437"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-09843-7_2","type":"book-chapter","created":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T18:04:44Z","timestamp":1656612284000},"page":"20-37","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Graph Rewriting Components"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4719-0772","authenticated-orcid":false,"given":"Reiko","family":"Heckel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6123-4175","authenticated-orcid":false,"given":"Andrea","family":"Corradini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0690-3051","authenticated-orcid":false,"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,6,26]]},"reference":[{"key":"2_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. 4178, pp. 153\u2013167. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11841883_12"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Boehm, P., Fonio, H., Habel, A.: Amalgamation of graph transformations: a synchronization mechanism. J. Comput. Syst. Sci. 34(2\/3), 377\u2013408 (1987). https:\/\/doi.org\/10.1016\/0022-0000(87)90030-4","DOI":"10.1016\/0022-0000(87)90030-4"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Gadducci, F., Kissinger, A., Sobocinski, P., Zanasi, F.: String diagram rewrite theory I: rewriting with Frobenius structure. J. ACM 69(2), 14:1\u201314:58 (2022)","DOI":"10.1145\/3502719"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bruni, R., Montanari, U., Sassone, V.: Observational congruences for dynamically reconfigurable tile systems. Theoret. Comput. Sci. 335(2\u20133), 331\u2013372 (2005). https:\/\/eprints.soton.ac.uk\/261844\/","DOI":"10.1016\/j.tcs.2004.10.044"},{"key":"2_CR5","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61284-8","volume-title":"Fundamentals of Algebraic Specification 2: Module Specifications and Constraints","author":"H Ehrig","year":"1990","unstructured":"Ehrig, H., Mahr, B.: Fundamentals of Algebraic Specification 2: Module Specifications and Constraints. EATCS Monographs on Theoretical Computer Science, vol. 21. Springer Verlag, Berlin (1990). https:\/\/doi.org\/10.1007\/978-3-642-61284-8"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Ehrig, H., K\u00f6nig, B.: Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Math. Struct. Comput. Sci. 16(6), 1133\u20131163 (2006). https:\/\/doi.org\/10.1017\/S096012950600569X","DOI":"10.1017\/S096012950600569X"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-540-31847-7_3","volume-title":"Formal Methods in Software and Systems Modeling","author":"G Engels","year":"2005","unstructured":"Engels, G., Heckel, R., Cherchago, A.: Flexible interconnection of graph transformation modules. In: Kreowski, H.-J., Montanari, U., Orejas, F., Rozenberg, G., Taentzer, G. (eds.) Formal Methods in Software and Systems Modeling. LNCS, vol. 3393, pp. 38\u201363. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31847-7_3"},{"key":"2_CR8","unstructured":"Evans, E.: Domain-Driven Design: Tackling Complexity in the Heart of Software. Addison-Wesley, Boston (2004)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11804192_2","volume-title":"Formal Methods for Components and Objects","author":"GL Ferrari","year":"2006","unstructured":"Ferrari, G.L., Hirsch, D., Lanese, I., Montanari, U., Tuosto, E.: Synchronised hyperedge replacement as a model for service oriented computing. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2005. LNCS, vol. 4111, pp. 22\u201343. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11804192_2"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Gadducci, F., Montanari, U.: The tile model. In: Plotkin, G.D., Stirling, C., Tofte, M. (eds.) Proof, Language, and Interaction, Essays in Honour of Robin Milner, pp. 133\u2013166. The MIT Press, Cambridge (2000)","DOI":"10.7551\/mitpress\/5641.003.0010"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-33654-6_16","volume-title":"Graph Transformations","author":"AH Ghamarian","year":"2012","unstructured":"Ghamarian, A.H., Rensink, A.: Generalised compositionality in graph transformation. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2012. LNCS, vol. 7562, pp. 234\u2013248. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33654-6_16"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-48483-3_10","volume-title":"Recent Trends in Algebraic Development Techniques","author":"M Groe-Rhode","year":"1999","unstructured":"Groe-Rhode, M., Presicce, F.P., Simeoni, M.: Refinements and modules for typed graph transformation systems. In: Fiadeiro, J.L. (ed.) WADT 1998. LNCS, vol. 1589, pp. 138\u2013151. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48483-3_10"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Heckel, R., Engels, G., Ehrig, H., Taentzer, G.: Classification and comparison of modularity concepts for graph transformation systems. In: Engels, G., Kreowski, H.J., Rozenberg, G. (eds.) Handbook of Graph Grammars and Computing by Graph Transformation, vol. 2, pp. 669\u2013690. World Scientific (1999)","DOI":"10.1142\/9789812815149_0017"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44685-0_9","volume-title":"CONCUR 2001 \u2014 Concurrency Theory","author":"H Dan","year":"2001","unstructured":"Dan, H., Ugo, M.: Synchronized hyperedge replacement with name mobility. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol. 2154, pp. 121\u2013136. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44685-0_9"},{"key":"2_CR15","unstructured":"Hogan, A., et al.: Knowledge Graphs. No. 22 in Synthesis Lectures on Data, Semantics, and Knowledge, Morgan & Claypool (2021). https:\/\/kgbook.org\/"},{"key":"2_CR16","unstructured":"Lassila, O.: Graph abstractions matter, December 2021. https:\/\/2021.connected-data.world"},{"key":"2_CR17","unstructured":"Schad, J.: Graph powered machine learning: Part 1. ML Conference Berlin, October 2021. https:\/\/mlconference.ai\/ml-summit\/"},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1023\/A:1008683005045","volume":"7","author":"G Taentzer","year":"1999","unstructured":"Taentzer, G.: Distributed graphs and graph transformation. Appl. Categorical Struct. 7(4), 431\u2013462 (1999)","journal-title":"Appl. Categorical Struct."},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Xiao, G., Ding, L., Cogrel, B., Calvanese, D.: Virtual knowledge graphs: an overview of systems and use cases. Data Intell. 1(3), 201\u2013223 (2019). https:\/\/doi.org\/10.1162\/dint_a_00011","DOI":"10.1162\/dint_a_00011"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-09843-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T05:40:49Z","timestamp":1727502049000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-09843-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031098420","9783031098437"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-09843-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"26 June 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Graph Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nantes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icgt2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"53% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}