A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs

DOI10.1007/978-3-030-99253-8_11arXiv2201.00233OpenAlexW4226057044MaRDI QIDQ6181929

Fabio Gadducci, Marino Miculan, Unnamed Author

Publication date: 23 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2201.00233

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

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
• DBtk: A Toolkit for Directed Bigraphs
• $\mathcal M, \mathcal N$ -Adhesive Transformation Systems
• Rule Algebras for Adhesive Categories
• Toposes Are Adhesive
• Quasitoposes, Quasiadhesive Categories and Artin Glueing
• The Space and Motion of Communicating Agents
• Parallelism and concurrency in high-level replacement systems
• Connected limits, familial representability and Artin glueing
• Hierarchical Graph Transformation Revisited
• Directed Bigraphs
• Graph Transformations
• Adhesive and quasiadhesive categories

This page was built for publication: A new criterion for \(\mathcal{M}, \mathcal{N} \)-adhesivity, with an application to hierarchical graphs