[en] The DPO approach for graph transformations is based on productions and direct transformations defined by two pushouts, where, roughly spoken, in the first pushout all items in L without K are deleted and in the second one all items R without K are added, while those items in K are preserved. Intuitively, K is the intersection of L and R and, formally, p is a span of graph morphisms. In this paper we consider productions which are cospans of graph morphisms, and K corresponds to the union of L and R. As before, direct transformations are defined by double pushouts, but now the first pushout adds all items in KnL and the second one deletes KnR. This basic idea can be extended to an alternative graph transformation approach, called cospan DPO approach. Key notions of the classical DPO approach can be reformulated in the cospan DPO approach and our main result shows in which way corresponding concepts and results are equivalent.
[University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
