Algebraic graph rewriting with controlled embedding
From MaRDI portal
Publication:2007726
DOI10.1016/j.tcs.2019.06.004zbMath1436.68155OpenAlexW2953826501WikidataQ127565669 ScholiaQ127565669MaRDI QIDQ2007726
Rachid Echahed, Frédéric Prost, Andrea Corradini, Leila Ribeiro, Dominique Duval
Publication date: 22 November 2019
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2019.06.004
Related Items
Uses Software
Cites Work
- Unnamed Item
- Algebraic approach to single-pushout graph transformation
- Parallel and distributed derivations in the single-pushout approach
- Adaptive star grammars and their languages
- Exponentiable morphisms, partial products and pullback complements
- Restriction categories II: Partial map classification
- Characterisation of parallel independence in AGREE-rewriting
- On the essence of parallel independence for the double-pushout and sesqui-pushout approaches
- The PBPO graph transformation approach
- Graph transformation for specification and programming
- Fundamentals of algebraic graph transformation
- Adhesivity with Partial Maps instead of Spans
- Graph Transformation with Focus on Incident Edges
- AGREE – Algebraic Graph Rewriting with Controlled Embedding
- Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
- Parallelism in AGREE Transformations
- Inductively Sequential Term-Graph Rewrite Systems
- Parallel and Sequential Independence for Borrowed Contexts
- Sesqui-Pushout Rewriting
- Handbook of Graph Grammars and Computing by Graph Transformation
- Graph Rewriting in Span-Categories
- The Pullback-Pushout Approach to Algebraic Graph Transformation
- Interacting quantum observables: categorical algebra and diagrammatics
- Analysis of permutation equivalence in -adhesive transformation systems with negative application conditions
- Pullback as a generic graph rewriting mechanism
