On the essence and initiality of conflicts in M -adhesive transformation systems
From MaRDI portal
Publication:2011208
Recommendations
- On the essence and initiality of conflicts
- Initial conflicts and dependencies: critical pairs revisited
- Granularity of conflicts and dependencies in graph transformation systems
- Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach
- Initial conflicts for transformation rules with nested application conditions
Cites work
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- M, N-adhesive transformation systems
- M-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
- A lattice-theoretical perspective on adhesive categories
- Adhesive and quasiadhesive categories
- AGREE -- algebraic graph rewriting with controlled embedding
- Algebraic approach to single-pushout graph transformation
- Attribute handling for generating preconditions from graph constraints
- Categorical frameworks for graph transformation and HLR systems based on the DPO approach
- Characterisation of parallel independence in AGREE-rewriting
- Conflict detection for model versioning based on graph modifications
- Critical pairs in term graph rewriting
- Double-pushout graph transformation revisited
- Efficient conflict detection in graph transformation systems by essential critical pairs
- Finitary \(\mathcal{M}\)-adhesive categories
- Formal Methods in Software and Systems Modeling
- Fundamentals of algebraic graph transformation
- Granularity of conflicts and dependencies in graph transformation systems
- Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach
- Graph rewriting in span-categories
- Graph Transformations
- Handbook of Graph Grammars and Computing by Graph Transformation
- scientific article; zbMATH DE number 3548465 (Why is no real title available?)
- scientific article; zbMATH DE number 1504830 (Why is no real title available?)
- scientific article; zbMATH DE number 2117177 (Why is no real title available?)
- scientific article; zbMATH DE number 919847 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- Initial conflicts and dependencies: critical pairs revisited
- Modular termination of graph transformation
- On graph rewritings
- On the essence and initiality of conflicts
- On the essence of parallel independence for the double-pushout and sesqui-pushout approaches
- Parallelism in AGREE transformations
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Recent trends in algebraic development techniques. 18th international workshop, WADT 2006, La Roche en Ardenne, Belgium, June 1--3, 2006. Revised selected papers.
- Restriction categories II: Partial map classification
- Restriction categories. I: Categories of partial maps
- Sesqui-Pushout Rewriting
- Symbolic graphs for attributed graph constraints
- Tableau-based reasoning for graph properties
- The pullback-pushout approach to algebraic graph transformation
- The Verigraph system for graph transformation
- Theory of constraints and application conditions: from graphs to high-level structures
- Use case analysis based on formal methods: an empirical study
Cited in
(20)- On the essence and initiality of conflicts
- Initial conflicts and dependencies: critical pairs revisited
- Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach
- Preface to the special issue on the 11th international conference on graph transformation
- Transformation rules with nested application conditions: critical pairs, initial conflicts \& minimality
- Module integration using graph grammars (MIGRATE)
- Double-pushout-rewriting in \(S\)-Cartesian functor categories: rewriting theory and application to partial triple graphs
- Unification of drags and confluence of drag rewriting
- Characterizing conflicts between rule application and rule evolution in graph transformation systems
- Rule algebras for adhesive categories
- Conflict Detection for Graph Transformation with Negative Application Conditions
- Granularity of conflicts and dependencies in graph transformation systems
- Initial conflicts for transformation rules with nested application conditions
- Efficient conflict detection in graph transformation systems by essential critical pairs
- -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
- 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
- Left-linear rewriting in adhesive categories
- On the axioms of \(\mathcal{M},\mathcal{N}\)-adhesive categories
This page was built for publication: On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011208)
