Author:
HABEL ANNEGRET,MÜLLER JÜRGEN,PLUMP DETLEF
Abstract
In this paper we investigate and compare four variants of the double-pushout approach to
graph transformation. As well as the traditional approach with arbitrary matching and
injective right-hand morphisms, we consider three variations by employing injective
matching and/or arbitrary right-hand morphisms in rules. We show that injective matching
provides additional expressiveness in two respects: for generating graph languages by
grammars without non-terminals and for computing graph functions by convergent graph
transformation systems. Then we clarify for each of the three variations whether the
well-known commutativity, parallelism and concurrency theorems are still valid and – where
this is not the case – give modified results. In particular, for the most general approach with
injective matching and arbitrary right-hand morphisms, we establish sequential and parallel
commutativity by appropriately strengthening sequential and parallel independence.
Publisher
Cambridge University Press (CUP)
Subject
Computer Science Applications,Mathematics (miscellaneous)
Cited by
74 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献