On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
From MaRDI portal
Publication:2011208
DOI10.1016/j.jlamp.2019.100482zbMath1435.68131OpenAlexW2970546136MaRDI QIDQ2011208
Leila Ribeiro, Guilherme Grochau Azzi, Andrea Corradini
Publication date: 28 November 2019
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2019.100482
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Grammars and rewriting systems (68Q42)
Related Items (max. 100)
Module integration using graph grammars (MIGRATE) ⋮ Initial Conflicts for Transformation Rules with Nested Application Conditions ⋮ Fundamentals of compositional rewriting theory ⋮ Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs ⋮ Unification of drags and confluence of drag rewriting ⋮ A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs ⋮ A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity ⋮ Preface to the special issue on the 11th international conference on graph transformation ⋮ Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality ⋮ Rule Algebras for Adhesive Categories
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lattice-theoretical perspective on adhesive categories
- Symbolic graphs for attributed graph constraints
- Algebraic approach to single-pushout graph transformation
- On graph rewritings
- Restriction categories II: Partial map classification
- On the essence and initiality of conflicts
- Characterisation of parallel independence in AGREE-rewriting
- On the essence of parallel independence for the double-pushout and sesqui-pushout approaches
- Initial conflicts and dependencies: critical pairs revisited
- The Verigraph system for graph transformation
- Modular termination of graph transformation
- Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach
- Recent trends in algebraic development techniques. 18th international workshop, WADT 2006, La Roche en Ardenne, Belgium, June 1--3, 2006. Revised selected papers.
- Fundamentals of algebraic graph transformation
- Double-pushout graph transformation revisited
- Use Case Analysis Based on Formal Methods: An Empirical Study
- ℳ-Adhesive Transformation Systems with Nested Application Conditions. Part 2: Embedding, Critical Pairs and Local Confluence
- $\mathcal M, \mathcal N$ -Adhesive Transformation Systems
- AGREE – Algebraic Graph Rewriting with Controlled Embedding
- Parallelism in AGREE Transformations
- Tableau-Based Reasoning for Graph Properties
- Attribute Handling for Generating Preconditions from Graph Constraints
- Sesqui-Pushout Rewriting
- Handbook of Graph Grammars and Computing by Graph Transformation
- Conflict Detection for Model Versioning Based on Graph Modifications
- Graph Rewriting in Span-Categories
- The Pullback-Pushout Approach to Algebraic Graph Transformation
- Granularity of Conflicts and Dependencies in Graph Transformation Systems
- Critical pairs in term graph rewriting
- Graph Transformations
- Adhesive and quasiadhesive categories
- Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
- Formal Methods in Software and Systems Modeling
- Finitary -adhesive categories
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Restriction categories. I: Categories of partial maps
This page was built for publication: On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
