A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity

DOI10.1016/j.tcs.2023.114280OpenAlexW4388036730MaRDI QIDQ6199404

Unnamed Author, Marino Miculan, Fabio Gadducci

Publication date: 23 February 2024

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.114280

zbMATH Keywords

graph rewritinghypergraphsrewriting systemsadhesive categoriesalgebraic rewritingterm graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic hierarchical graph transformation
• On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
• Bigraphs with sharing
• Fundamentals of algebraic graph transformation
• On the axioms for adhesive and quasiadhesive categories
• $\mathcal M, \mathcal N$ -Adhesive Transformation Systems
• Simply Connected Limits
• Rule Algebras for Adhesive Categories
• Quasitoposes, Quasiadhesive Categories and Artin Glueing
• The Space and Motion of Communicating Agents
• Correctness of high-level transformation systems relative to nested conditions
• Parallelism and concurrency in high-level replacement systems
• Connected limits, familial representability and Artin glueing
• Hierarchical Graph Transformation Revisited
• String Diagram Rewrite Theory I: Rewriting with Frobenius Structure
• Graph Transformations
• Adhesive and quasiadhesive categories
• Fundamentals of compositional rewriting theory

This page was built for publication: A simple criterion for \(\mathcal{M}, \mathcal{N}\)-adhesivity