Amalgamation of graph transformations: a synchronization mechanism
Journal of Computer and System Sciences
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
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Proceedings of the International Workshop on Graph Transformations in Computer Science
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Correctness of high-level transformation systems relative to nested conditions†
Mathematical Structures in Computer Science
A Collection Operator for Graph Transformation
ICMT '09 Proceedings of the 2nd International Conference on Theory and Practice of Model Transformations
Cloning and Expanding Graph Transformation Rules for Refactoring
Electronic Notes in Theoretical Computer Science (ENTCS)
Parallel independence of amalgamated graph transformations applied to model transformation
Graph transformations and model-driven engineering
Refined graph rewriting in span-categories: a framework for algebraic graph transformation
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
Generalised compositionality in graph transformation
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
A declarative and bidirectional model transformation approach based on graph co-spans
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming
Hi-index | 0.00 |
Amalgamation is a well-known concept for graph transformations in order to model synchronized parallelism of rules with shared subrules and corresponding transformations. This concept is especially important for an adequate formalization of the operational semantics of statecharts and other visual modeling languages, where typed attributed graphs are used for multiple rules with general application conditions. However, the theory of amalgamation for the double pushout approach has been developed up to now only on a set-theoretical basis for pairs of standard graph rules without any application conditions. For this reason, we present the theory of amalgamation in this paper in the framework of adhesive categories for a bundle of rules with (nested) application conditions. In fact, it is also valid for weak adhesive HLR categories. The main result is the Multi-Amalgamation Theorem, which generalizes the well-known Parallelism and Amalgamation Theorems to the case of multiple synchronized parallelism. The constructions are illustrated by a small running example. A more complex case study for the operational semantics of statecharts based on multi-amalgamation is presented in a separate paper.