The PBPO graph transformation approach

Abstract : We propose a new algebraic approach to graph transformation, called the Pullback-Pushout (PBPO) approach, where we combine smoothly the classical modifications to a host graph specified by a first part of a rule, defined as a span of graph morphisms, with the cloning of structures specified by a second span. The motivation behind this new approach is to support cloning of structures in an elegant and efficient way. After a formal definition of the proposed approach, we demonstrate that PBPO rewriting is a conservative extension of agree and the Sesqui-Pushout approaches. Contrary to agree, we show that the proposed PBPO transformation can easily be extended to cope with attributed graphs. In general, totally attributed graphs are not closed under PBPO transformation. We propose sufficient conditions which guarantee that the attribution of transformed graphs is total. Furthermore, a PBPO transformation can affect all parts of a host graph including non local parts (i.e., parts which are outside the image of the left-hand side of a rule). We propose and discuss some conditions which ensure a form of locality of PBPO transformations.
Liste complète des métadonnées
Contributor : Dominique Duval <>
Submitted on : Thursday, January 17, 2019 - 11:29:09 AM
Last modification on : Tuesday, April 2, 2019 - 1:00:15 AM




Andrea Corradini, Dominique Duval, Rachid Echahed, Frederic Prost, Leila Ribeiro. The PBPO graph transformation approach. Journal of Logical and Algebraic Methods in Programming, Elsevier, 2019, 103, pp.213-231. ⟨10.1016/j.jlamp.2018.12.003⟩. ⟨hal-01984720⟩



Record views