M-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
DOI10.3233/FI-2012-705zbMATH Open1242.68128OpenAlexW1843363608MaRDI QIDQ2898463FDOQ2898463
Authors: Hartmut Ehrig, Ulrike Golas, Leen Lambers, Fernando Orejas, 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
Recommendations
- Local Confluence for Rules with Nested Application Conditions
- Embedding and Confluence of Graph Transformations with Negative Application Conditions
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Theory of constraints and application conditions: from graphs to high-level structures
- \(\mathcal M, \mathcal N\)-adhesive transformation systems
embeddingcritical pairslocal confluence\(\mathcal M\)-adhesive categories\(\mathcal M\)-adhesive transformation systemsgraph replacement categoriesnested application conditions
Graph theory (including graph drawing) in computer science (68R10) Grammars and rewriting systems (68Q42) Abstract data types; algebraic specification (68Q65)
Cited In (23)
- On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Variability-based model transformation: formal foundation and application
- Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach
- Analysis of permutation equivalence in \(\mathcal{M}\)-adhesive transformation systems with negative application conditions
- Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
- Theory of constraints and application conditions: from graphs to high-level structures
- Graph Transformations
- Correctness of high-level transformation systems relative to nested conditions
- Nested Quantification in Graph Transformation Rules
- Title not available (Why is that?)
- Canonical derivations with negative application conditions
- Transformation systems with incremental negative application conditions
- Confluence up to garbage
- Initial conflicts for transformation rules with nested application conditions
- Confluence up to garbage in graph transformation
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
- Rewriting theory for the life sciences: a unifying theory of CTMC semantics
- Evaluation diversity for graph conditions
- Conditional reactive systems
- Embedding and Confluence of Graph Transformations with Negative Application Conditions
- Reconfigurable Petri nets with transition priorities and inhibitor arcs
This page was built for publication: \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898463)
