ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence

DOI10.3233/FI-2012-705zbMath1242.68128OpenAlexW1843363608MaRDI QIDQ2898463

Hartmut Ehrig, Leen Lambers, Fernando Orejas, Ulrike Golas, Annegret Habel

Publication date: 11 July 2012

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2012-705

zbMATH Keywords

embeddingcritical pairslocal confluence\(\mathcal M\)-adhesive categories\(\mathcal M\)-adhesive transformation systemsgraph replacement categoriesnested application conditions

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Abstract data types; algebraic specification (68Q65) Grammars and rewriting systems (68Q42)

Related Items (12)

Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs ⋮ Initial Conflicts for Transformation Rules with Nested Application Conditions ⋮ Rewriting Theory for the Life Sciences: A Unifying Theory of CTMC Semantics ⋮ Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs ⋮ Unnamed Item ⋮ Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach ⋮ Variability-based model transformation: formal foundation and application ⋮ On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems ⋮ Evaluation diversity for graph conditions ⋮ Confluence up to garbage in graph transformation ⋮ Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality ⋮ Rewriting theory for the life sciences: a unifying theory of CTMC semantics

This page was built for publication: ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence