TY - CONF
AB - Single pushout graph transformations at injective matches are extended by negative application conditions. It is shown, how right-sided application conditions can be transformed into equivalent left-sided ones. Based on this result, conditional derived rules are introduced and a theorem, similiar to the double pushout embedding theorem is shown. Finally, three variants of contextual application conditions are discussed with respect to their expressive power and expected results.
AU - Heckel, Reiko
ID - 7833
IS - B-19
T2 - Proceedings of the Colloquium on Graph Transformation and its Application in Computer Science
TI - Embedding of Conditional Graph Transformations
ER -