singlepushout
Single pushout is a graph transformation approach in which a rewrite step is defined by a single pushout construction in a suitable category, typically graphs and graph morphisms. A rewrite rule is given by a span L <- K -> R, where L is the left-hand side, R the right-hand side, and K the interface.
To apply the rule to a host graph G, one selects a match m: L -> G that
Key properties of the single pushout approach include its permissiveness regarding deletion. If the application would
Compared with the double pushout (DPO) framework, SPO typically uses one pushout and is thus often simpler