A simple criterion for M, N-adhesivity

DOI10.1016/J.TCS.2023.114280MaRDI QIDQ6199404zbMATH OpenOpenAlexFDO

Authors Fabio Gadducci, Marino Miculan

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

adhesive categoriesalgebraic rewritinggraph rewritinghypergraphsrewriting systemsterm graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• M, N-adhesive transformation systems
• Abstract and concrete categories: the joy of cats
• Adhesive and quasiadhesive categories
• Algebraic hierarchical graph transformation
• Bigraphs with sharing
• Connected limits, familial representability and Artin glueing
• Correctness of high-level transformation systems relative to nested conditions
• Fundamentals of algebraic graph transformation
• Fundamentals of compositional rewriting theory
• Graph Transformations
• Hierarchical Graph Transformation Revisited
• scientific article; zbMATH DE number 2134022 (Why is no real title available?)
• scientific article; zbMATH DE number 7456060 (Why is no real title available?)
• On term graphs as an adhesive category
• On the axioms for adhesive and quasiadhesive categories
• On the essence and initiality of conflicts in \(\mathcal{M} \)-adhesive transformation systems
• Parallelism and concurrency in high-level replacement systems
• Quasitoposes, Quasiadhesive Categories and Artin Glueing
• Rule algebras for adhesive categories
• Simply Connected Limits
• String diagram rewrite theory. I: Rewriting with Frobenius structure
• The Space and Motion of Communicating Agents

Cited in

(2)

• Left-linear rewriting in adhesive categories
• On the axioms of \(\mathcal{M},\mathcal{N}\)-adhesive categories

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6199404)