Pushout-complements and basic concepts of grammars in toposes
Theoretical Computer Science
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
A completeness theorem for Kleene algebras and the algebra of regular events
Papers presented at the IEEE symposium on Logic in computer science
Algebraic approaches to graph transformation. Part I: basic concepts and double pushout approach
Handbook of graph grammars and computing by graph transformation
A Relation-Algebraic Approach to Graph Structure Transformation
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Collagories for Relational Adhesive Rewriting
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Dependently-typed formalisation of relation-algebraic abstractions
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Refined graph rewriting in span-categories: a framework for algebraic graph transformation
ICGT'12 Proceedings of the 6th international conference on Graph Transformations
| Hi-index | 0.00 |
The relation-algebraic approach to graph transformation replaces the universal category-theoretic characterisations of pushout and pullbacks with the local characterisations of tabulations and co-tabulations. The theory of collagories is a weak axiomatisation of relationalgebraic operations that closely corresponds to adhesive categories. We show how to amalgamate double-pushout and double-pullback rewriting steps into a fused rewriting concept where rules can contain subgraph variables in a natural and flexible way, and rewriting can delete or duplicate the matched instances of such variables.