{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:19Z","timestamp":1761611059589},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"6","license":[{"start":{"date-parts":[[1999,12,1]],"date-time":"1999-12-01T00:00:00Z","timestamp":944006400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1999,12]]},"abstract":"<jats:title>Abstract.<\/jats:title>\n          <jats:p>The aim of the paper is to introduce the notion of a transformation unit together with its interleaving semantics and to study it as a means of constructing large graph transformation systems from small ones in a structured and systematic way. A transformation unit comprises a set of rules, descriptions of initial and terminal graphs, and a control condition. Moreover, it may import other transformation units for structuring purposes. Its semantics is a binary relation between initial and terminal graphs which is given by interleaving sequences. As a generalization of ordinary derivations, an interleaving sequence consists of direct derivation steps interleaved with calls of imported transformation units. It must obey the control condition and may be seen as a kind of structured derivation. The introduced framework is independent of a particular graph transformation approach and, therefore, it may enhance the usefulness of graph transformations in many contexts.<\/jats:p>","DOI":"10.1007\/s001659970005","type":"journal-article","created":{"date-parts":[[2002,10,6]],"date-time":"2002-10-06T15:32:07Z","timestamp":1033918327000},"page":"690-723","source":"Crossref","is-referenced-by-count":41,"title":["Graph Transformation Units with Interleaving Semantics"],"prefix":"10.1145","volume":"11","author":[{"given":"Hans-J\u00f6rg","family":"Kreowski","sequence":"first","affiliation":[{"name":"University of Bremen, Department of Mathematics and Computer Science, Bremen, Germany, , , , , , DE"}]},{"given":"Sabine","family":"Kuske","sequence":"additional","affiliation":[{"name":"University of Bremen, Department of Mathematics and Computer Science, Bremen, Germany, , , , , , DE"}]}],"member":"320","reference":[{"issue":"1","key":"p_1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6423(98)00023-9","article-title":"Graph transformation for specification and programming","volume":"34","author":"Andries Marc","year":"1999","journal-title":"Science of Computer Programming"},{"key":"p_2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BFb0025718","volume-title":"Proc. Graph Grammars and Their Application to Computer Science and Biology","author":"Bunke Horst","year":"1979"},{"key":"p_3","volume-title":"Handbook of Theoretical Computer Science","author":"Courcelle Bruno","year":"1990"},{"key":"p_4","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74932-2","volume-title":"Regulated Rewriting in Formal Language Theory","author":"Dassow J\u00fcrgen","year":"1989"},{"key":"p_5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/3-540-61228-9_84","volume-title":"Proc. Graph Grammars and Their Application to Computer Science","author":"Ehrig Hartmut","year":"1996"},{"key":"p_6","volume-title":"Languages and Tools","author":"Ehrig Hartmut","year":"1999"},{"key":"p_7","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-3-642-95486-3_7","volume-title":"The Book of L","author":"Ehrig Hartmut","year":"1986"},{"key":"p_8","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Proc. Graph Grammars and Their Application to Computer Science and Biology","author":"Ehrig Hartmut","year":"1979"},{"key":"p_9","volume-title":"World Scientific","author":"Ehrig Hartmut","year":"1999"},{"key":"p_10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/BFb0017401","volume-title":"Proc. Graph Grammars and Their Application to Computer Science","author":"Glauert John R. W.","year":"1991"},{"key":"p_11","series-title":"Lecture Notes in Computer Science","volume-title":"Hyperedge Replacement: Grammars and Languages","author":"Habel Annegret","year":"1992"},{"key":"p_12","volume-title":"Graph grammars with negative application conditions. Fundamenta Informaticae, 26(3,4):287-313","author":"Habel Annegret","year":"1996"},{"key":"p_13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0017378","volume-title":"Proc. Graph Grammars and Their Application to Computer Science","author":"Himsolt Michael","year":"1991"},{"key":"p_14","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0020-0255(80)90038-9","article-title":"On the structure of node-label-controlled graph languages","volume":"20","author":"Janssens Dirk","year":"1980","journal-title":"Information Sciences"},{"key":"p_15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-61228-9_81","volume-title":"Proc. Graph Grammars and Their Application to Computer Science","author":"Kreowski Hans-J\u00f6rg","year":"1996"},{"key":"p_16","first-page":"607","volume-title":"Ehrig et al. [EEK99]","author":"Kreowski Hans-J\u00f6rg"},{"issue":"4","key":"p_17","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1142\/S0218194097000278","article-title":"Nested graph transformation units","volume":"7","author":"Kreowski Hans-J\u00f6rg","year":"1997","journal-title":"International Journal on Software Engineering and Knowledge Engineering"},{"key":"p_18","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0255(90)90042-9","article-title":"On structured graph grammars","volume":"52","author":"Kreowski Hans-J\u00f6rg","year":"1990","journal-title":"I and II. Information Sciences"},{"key":"p_19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/3-540-57163-9_5","volume-title":"Zolt\u00e1n \u00c9sik","author":"Kreowski Hans-J\u00f6rg","year":"1993"},{"key":"p_20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/3-540-56868-9_36","volume-title":"Proc. Rewriting Techniques and Applications","author":"L\u00f6we Michael","year":"1993"},{"key":"p_21","volume-title":"Handbook of Theoretical Computer Science","author":"Lengauer Thomas"},{"key":"p_22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0304-3975(93)90116-B","article-title":"Computing with graph rewriting systems with priorities","volume":"115","author":"Litovsky Igor","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"p_23","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(93)90068-5","article-title":"Algebraic approach to single-pushout graph transformation","volume":"109","author":"L\u00f6we Michael","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"p_24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"582","DOI":"10.1007\/BFb0017414","volume-title":"Proc. Graph Grammars and Their Application to Computer Science","author":"Maggiolo-Schettini Andrea","year":"1991"},{"issue":"6","key":"p_25","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s002360050056","article-title":"A kernel language for programmed rewriting of (hyper)graphs","volume":"33","author":"Maggiolo-Schettini Andrea","year":"1996","journal-title":"Acta Informatica"},{"key":"p_26","volume-title":"Implementierungen. Vieweg","author":"Nagl Manfred","year":"1979"},{"key":"p_27","volume-title":"World Scientific","author":"Rozenberg Grzegorz","year":"1997"},{"key":"p_29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/BFb0017419","volume-title":"Proc. Graph Grammars and Their Application to Computer Science","author":"Sch\u00fcrr Andy","year":"1991"},{"key":"p_30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1007\/3-540-61228-9_83","volume-title":"Proc. Graph Grammars and Their Application to Computer Science","author":"Sch\u00fcrr Andy","year":"1996"},{"key":"p_31","series-title":"Lecture Notes in Computer Science","first-page":"48","volume-title":"Proc. Graph-Theoretic Concepts in Computer Science","author":"Sch\u00fcrr Andy","year":"1991"},{"key":"p_32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1007\/3-540-57787-4_24","volume-title":"Proc. Graph Transformations in Computer Science","author":"Taentzer Gabriele","year":"1994"},{"key":"p_33","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"another step towards a module concept for graph transformation systems","author":"Taentzer Gabriele","year":"1995"},{"key":"p_34","volume-title":"Computational Aspects of VLSI","author":"Ullman Jeffrey D.","year":"1984"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s001659970005.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s001659970005\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s001659970005","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:34:19Z","timestamp":1641483259000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s001659970005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,12]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1999,12]]}},"alternative-id":["10.1007\/s001659970005"],"URL":"https:\/\/doi.org\/10.1007\/s001659970005","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,12]]}}}