On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
type: Item
instance of: scholarly article
title: On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
zbMATH Open document ID: 1435.68131
author: Guilherme Grochau Azzi
author: Andrea Corradini
author: Leila Ribeiro
published in: Journal of Logical and Algebraic Methods in Programming
publication date: 2019-11-28T00:00:00Z
Mathematics Subject Classification ID: 68Q42
Mathematics Subject Classification ID: 68Q85
zbMATH DE Number: 7138316
zbMATH Keywords: graph transformation
zbMATH Keywords: double pushout
zbMATH Keywords: parallel independence
zbMATH Keywords: critical pair
zbMATH Keywords: initial conflict
describes a project that uses: AGG
describes a project that uses: Verigraph
describes a project that uses: AGREE
MaRDI profile type: Publication
full work available at URL: j.jlamp.2019.100482
OpenAlex ID: W2970546136
cites work: The Verigraph system for graph transformation
cites work: On the essence and initiality of conflicts
cites work: A lattice-theoretical perspective on adhesive categories
cites work: Granularity of Conflicts and Dependencies in Graph Transformation Systems
cites work: Restriction categories. I: Categories of partial maps
cites work: Restriction categories II: Partial map classification
cites work: AGREE – Algebraic Graph Rewriting with Controlled Embedding
cites work: The Pullback-Pushout Approach to Algebraic Graph Transformation
cites work: On the essence of parallel independence for the double-pushout and sesqui-pushout approaches
cites work: Parallelism in AGREE Transformations
cites work: Sesqui-Pushout Rewriting
cites work: Handbook of Graph Grammars and Computing by Graph Transformation
cites work: Attribute Handling for Generating Preconditions from Graph Constraints
cites work: Q3416077
cites work: Fundamentals of algebraic graph transformation
cites work: \(\mathcal M\)-adhesive transformation systems with nested application conditions. II: Embedding, critical pairs and local confluence
cites work: -adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation
cites work: Q4904140
cites work: Graph Transformations
cites work: Q4122833
cites work: Finitary -adhesive categories
cites work: Q4890712
cites work: Q4502808
cites work: Double-pushout graph transformation revisited
cites work: Formal Methods in Software and Systems Modeling
cites work: $\mathcal M, \mathcal N$ -Adhesive Transformation Systems
cites work: Q4828514
cites work: Q5581665
cites work: Adhesive and quasiadhesive categories
cites work: Granularity of conflicts and dependencies in graph transformation systems: a two-dimensional approach
cites work: Initial conflicts and dependencies: critical pairs revisited
cites work: Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
cites work: Tableau-Based Reasoning for Graph Properties
cites work: Algebraic approach to single-pushout graph transformation
cites work: Graph Rewriting in Span-Categories
cites work: Characterisation of parallel independence in AGREE-rewriting
cites work: Recent trends in algebraic development techniques. 18th international workshop, WADT 2006, La Roche en Ardenne, Belgium, June 1--3, 2006. Revised selected papers.
cites work: Use Case Analysis Based on Formal Methods: An Empirical Study
cites work: Symbolic graphs for attributed graph constraints
cites work: Critical pairs in term graph rewriting
cites work: Processes, Terms and Cycles: Steps on the Road to Infinity
cites work: Modular termination of graph transformation
cites work: On graph rewritings
cites work: Conflict Detection for Model Versioning Based on Graph Modifications
DOI: 10.1016/J.JLAMP.2019.100482
description: scientific article; zbMATH DE number 7138316