Algebraic approach to single-pushout graph transformation
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Elementary categories, elementary toposes
Elementary categories, elementary toposes
Graph Rewriting in Some Categories of Partial Morphisms
Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Graph rewriting in span-categories
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Hereditary pushouts reconsidered
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Multi-amalgamation in adhesive categories
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Amalgamating pushout and pullback graph transformation in collagories
ICGT'10 Proceedings of the 5th international conference on Graph transformations
ICGT'06 Proceedings of the Third international conference on Graph Transformations
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Pattern graphs and rule-based models: the semantics of kappa
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
There are three major algebraic approaches to graph transformation, namely the double-pushout (DPO), single-pushout (SPO), and sesqui-pushout approach (SqPO). In this paper, we present a framework that generalises all three approaches. The central issue is a gluing construction, which is a generalisation of the construction introduced in [14]. It has pushout-like properties wrt. composition and decomposition, which allow to reestablish major parts of the theory for the algebraic approaches on a general level. We investigate parallel independence here.