Hierarchical Graph Transformation Revisited
DOI10.1007/978-3-319-61470-0_2zbMATH Open1425.68171OpenAlexW2639154722MaRDI QIDQ4972007FDOQ4972007
Authors: J. Padberg 
Publication date: 22 November 2019
Published in: Graph Transformation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-61470-0_2
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
Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30)
Cited In (7)
- Fundamentals of compositional rewriting theory
- Double-pullback transitions and coalgebraic loose semantics for graph transformation systems
- A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs
- Refined Graph Rewriting in Span-Categories
- A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity
- 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).
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)
