Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Handbook of graph grammars and computing by graph transformation: vol. 2: applications, languages, and tools
Handbook of graph grammars and computing by graph transformation
Introduction to the Algebraic Theory of Graph Grammars (A Survey)
Proceedings of the International Workshop on Graph-Grammars and Their Application to Computer Science and Biology
Graph rewriting with unification and composition
Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science
Double-pushout graph transformation revisited
Mathematical Structures in Computer Science
The Graph Programming Language GP
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Extending C for Checking Shape Safety
Electronic Notes in Theoretical Computer Science (ENTCS)
Graph transformation systems in CHR
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A unified categorical approach for attributed graph rewriting
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
A hoare calculus for graph programs
ICGT'10 Proceedings of the 5th international conference on Graph transformations
Graph transformation with variables
Formal Methods in Software and Systems Modeling
Changing labels in the double-pushout approach can be treated categorically
Formal Methods in Software and Systems Modeling
Graph transformation in constant time
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Hoare-Style Verification of Graph Programs
Fundamenta Informaticae - Recent Developments in the Theory of Graph Transformation, 2010
A general attribution concept for models in M-adhesive transformation systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
M,N-adhesive transformation systems
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
The traditional double-pushout approach to graph transformation does not allow to change node labels in an arbitrary context. We propose a simple solution to this problem, namely to use rules with partially labelled interface graphs and to match rules injectively. In [8] we have shown that injective matching makes the double-pushout approach more expressive, and here we further generalise that approach. Besides solving the relabelling problem, our framework allows to write rules with partially labelled left-hand sides which are equivalent to (possibly infinite) sets of rules in the traditional setting. Unlike previous work on rules with partially labelled graphs, we do not need any labelling condition on matching morphisms, nor do we exclude node merging rules.