Graph Transformations

DOI10.1007/b100934zbMath1116.68480OpenAlexW4214712303MaRDI QIDQ5292592

Hartmut Ehrig, Ulrike Prange, Annegret Habel, Julia 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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42)

Related Items (21)

Van Kampen Colimits as Bicolimits in Span ⋮ Amalgamation of domain specific languages with behaviour ⋮ Characterizing Conflicts Between Rule Application and Rule Evolution in Graph Transformation Systems ⋮ Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics ⋮ Fundamentals of compositional rewriting theory ⋮ A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs ⋮ A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity ⋮ From Algebraic Graph Transformation to Adhesive HLR Categories and Systems ⋮ Unnamed Item ⋮ Confluence of Graph Rewriting with Interfaces ⋮ Workshop on Petri Nets and Graph Transformations ⋮ Integration of categorical frameworks: Rule-based refinement and hierarchical composition for components ⋮ Construction and properties of adhesive and weak adhesive high-level replacement categories ⋮ Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs ⋮ On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems ⋮ Synthesising CCS bisimulation using graph rewriting ⋮ Rewriting theory for the life sciences: a unifying theory of CTMC semantics ⋮ Rule Algebras for Adhesive Categories ⋮ Rule-based transformation of graph rewriting rules: towards higher-order graph grammars ⋮ Concurrency theorems for non-linear rewriting theories ⋮ String diagram rewrite theory III: Confluence with and without Frobenius

This page was built for publication: Graph Transformations