Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Theoretical Computer Science
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation: volume I. foundations
Handbook of graph grammars and computing by graph transformation
Programmed graph replacement systems
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
Confluence of Typed Attributed Graph Transformation Systems
ICGT '02 Proceedings of the First International Conference on Graph Transformation
Fundamentals of Algebraic Graph Transformation (Monographs in Theoretical Computer Science. An EATCS Series)
Electronic Notes in Theoretical Computer Science (ENTCS)
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Graphical reasoning in compact closed categories for quantum computation
Annals of Mathematics and Artificial Intelligence
Matrix Graph Grammars with Application Conditions
Fundamenta Informaticae
| Hi-index | 0.00 |
In this work we present our approach to (simple di-)graph transformation based on an algebra of boolean matrices. Rules are represented as boolean matrices for nodes and edges and derivations can be efficiently characterized with boolean operations only. Our objective is to analyze properties inherent to rules themselves (without considering an initial graph), so this information can be calculated at specification time. We present basic results concerning well-formedness of rules and derivations (compatibility), as well as concatenation of rules, the conditions under which they are applicable (coherence) and permutations. We introduce the match, which permits the identification of a grammar rule left hand side inside a graph. We follow a similar approach to the single pushout approach (SPO), where dangling edges are deleted, but we first adapt the rule in order to take into account any deleted edge. To this end, a notation borrowed from functional analysis is used. We study the conditions under which the calculated data at specification time can be used when the match is considered.