Graph Transformations
From MaRDI portal
Publication:5292592
DOI10.1007/B100934zbMATH Open1116.68480OpenAlexW4214712303MaRDI QIDQ5292592FDOQ5292592
Authors: Hartmut Ehrig, Ulrike Prange, Annegret Habel, J. Padberg
Publication date: 21 June 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b100934
Recommendations
- Adhesive high-level replacement systems: a new categorical framework for graph transformation
- Construction and properties of adhesive and weak adhesive high-level replacement categories
- Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations
- Categorical frameworks for graph transformation and HLR systems based on the DPO approach
- Adhesivity with partial maps instead of spans
Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)
Cited In (29)
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- Fundamentals of compositional rewriting theory
- Title not available (Why is that?)
- Concurrency theorems for non-linear rewriting theories
- From Algebraic Graph Transformation to Adhesive HLR Categories and Systems
- Sticker systems
- Basic results for two types of high-level replacement systems
- Graph Transformations
- Adhesive high-level replacement systems: a new categorical framework for graph transformation
- Rule-based transformation of graph rewriting rules: towards higher-order graph grammars
- A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs
- Van Kampen colimits as bicolimits in Span
- Efficient conflict detection in graph transformation systems by essential critical pairs
- Confluence of graph rewriting with interfaces
- A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics
- Workshop on Petri Nets and Graph Transformations
- Characterizing conflicts between rule application and rule evolution in graph transformation systems
- Synthesising CCS bisimulation using graph rewriting
- Construction and properties of adhesive and weak adhesive high-level replacement categories
- Amalgamation of domain specific languages with behaviour
- Weak Adhesive High-Level Replacement Categories and Systems: A Unifying Framework for Graph and Petri Net Transformations
- Adhesivity with partial maps instead of spans
- Integration of categorical frameworks: Rule-based refinement and hierarchical composition for components
- Rule algebras for adhesive categories
- Categorical frameworks for graph transformation and HLR systems based on the DPO approach
- Towards algebraic high-level systems as weak adhesive HLR categories
- String diagram rewrite theory III: Confluence with and without Frobenius
This page was built for publication: Graph Transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5292592)