Graph transformation with symbolic attributes via monadic coalgebra homomorphisms

We show how a coalgebraic approach leads to more natural representations of many kinds of graph structures that in the algebraic approach are frequently dealt with using ad-hoc constructions. For the case of symbolically attributed graphs, we demonstrate how using substituting coalgebra homomorphisms in double-pushout rewriting steps yields a powerful and easily understandable transformation mechanism.