{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T21:37:27Z","timestamp":1790890647983,"version":"4.1.0"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"5","license":[{"start":{"date-parts":[[2001,9,25]],"date-time":"2001-09-25T00:00:00Z","timestamp":1001376000000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2001,10]]},"abstract":"<jats:p>In this paper we investigate and compare four variants of the double-pushout approach to \ngraph transformation. As well as the traditional approach with arbitrary matching and \ninjective right-hand morphisms, we consider three variations by employing injective \nmatching and\/or arbitrary right-hand morphisms in rules. We show that injective matching \nprovides additional expressiveness in two respects: for generating graph languages by \ngrammars without non-terminals and for computing graph functions by convergent graph \ntransformation systems. Then we clarify for each of the three variations whether the \nwell-known commutativity, parallelism and concurrency theorems are still valid and \u2013 where \nthis is not the case \u2013 give modified results. In particular, for the most general approach with \ninjective matching and arbitrary right-hand morphisms, we establish sequential and parallel \ncommutativity by appropriately strengthening sequential and parallel independence.<\/jats:p>","DOI":"10.1017\/s0960129501003425","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T13:16:36Z","timestamp":1027775796000},"page":"637-688","source":"Crossref","is-referenced-by-count":79,"title":["Double-pushout graph transformation revisited"],"prefix":"10.1017","volume":"11","author":[{"given":"ANNEGRET","family":"HABEL","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00dcRGEN","family":"M\u00dcLLER","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"DETLEF","family":"PLUMP","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"56","published-online":{"date-parts":[[2001,9,25]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129501003425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T22:49:42Z","timestamp":1557269382000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129501003425\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,9,25]]},"references-count":0,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0960129501003425"],"URL":"https:\/\/doi.org\/10.1017\/s0960129501003425","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,9,25]]}}}