Hierarchical Graph Transformation Revisited
From MaRDI portal
Publication:4972007
Recommendations
- Allegories and collagories for transformation of graph structures considered as coalgebras
- Abstract hierarchical graph transformation
- Comparing Notions of Hierarchical Graph Transformation1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph).
- Algebraic hierarchical graph transformation
- A higher-order calculus for graph transformation
- Double-pullback transitions and coalgebraic loose semantics for graph transformation systems
- Graph Transformation by Computational Category Theory
- Generalised compositionality in graph transformation
- Hierarchical graph transformation
- scientific article; zbMATH DE number 1512612
Cited in
(7)- A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs
- Refined Graph Rewriting in Span-Categories
- Hierarchical graph transformation
- A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity
- Fundamentals of compositional rewriting theory
- Comparing Notions of Hierarchical Graph Transformation1 1This work has been partially supported by the ESPRIT Working Group Applications of Graph Transformation (Appligraph).
- Double-pullback transitions and coalgebraic loose semantics for graph transformation systems
This page was built for publication: Hierarchical Graph Transformation Revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4972007)