| Автор | HABEL, ANNEGRET |
| Автор | MÜLLER, JÜRGEN |
| Автор | PLUMP, DETLEF |
| Дата выпуска | 2001 |
| dc.description | 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. |
| Издатель | Cambridge University Press |
| Название | Double-pushout graph transformation revisited This research was partly supported by the ESPRIT Working Group APPLIGRAPH. This paper is an extension of Habel et al. (2000). |
| DOI | 10.1017/S0960129501003425 |
| Electronic ISSN | 1469-8072 |
| Print ISSN | 0960-1295 |
| Журнал | Mathematical Structures in Computer Science |
| Том | 11 |
| Первая страница | 637 |
| Последняя страница | 688 |
| Аффилиация | HABEL ANNEGRET; Universität Oldenburg |
| Аффилиация | MÜLLER JÜRGEN; |
| Аффилиация | PLUMP DETLEF; The University of York |
| Выпуск | 5 |
