Double-Pushout Rewriting in Context
Double-pushout rewriting (DPO) is the most popular algebraic approach to graph transformation. Most of its theory has been developed for linear rules, which allow deletion, preservation, and addition of vertices and edges only. Deletion takes place in a careful and circumspect way: a double pushout derivation does never delete vertices or edges which are not in the image of the applied match. Due to these restrictions, every DPO-rewrite is invertible. In this paper, we extend the DPO-approach to non-linear and still invertible rules. Some model transformation examples show that the extension is worthwhile from the practical point of view. And there is a good chance for the extension of the existing theory. In this paper, we investigate parallel independence.
- 1.Corradini, A., Duval, D., Echahed, R., Prost, F., Ribeiro, L.: AGREE – algebraic graph rewriting with controlled embedding. In: Parisi-Presicce, F., Westfechtel, B. (eds.) ICGT 2015. LNCS, vol. 9151, pp. 35–51. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21145-9_3CrossRefzbMATHGoogle Scholar
- 6.Gamma, E., et al.: Design Patterns: Elements of Reusable Object-Oriented Software. Addison-Wesley, Boston (1994)Google Scholar
- 10.Heindel, T.: Hereditary pushouts reconsidered. In: Ehrig et al. , pp. 250–265 (2010)Google Scholar
- 12.Löwe, M.: Graph rewriting in span-categories. In: Ehrig et al. , pp. 218–233 (2010)Google Scholar
- 14.Löwe, M.: Double pushout rewriting in context. Technical report 2018/02, Fachhochschule für die. Wirtschaft, Hannover (2018)Google Scholar