Composition of M,N-adhesive Categories with Application to Attribution of Graphs

2016/04/18 by Christoph Peuser, Peuser, Christoph, Annegret Habel +1
Computer Science · #Formal Methods in Verification #Logic, programming, and type systems #Model-Driven Software Engineering Techniques

paper · doi:10.14279/tuj.eceasst.73.1035

openalex publication_date 2024/03/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/01

Abstract

This paper continues the work on M,N-adhesive categories and shows some important composition properties for these categories. We present a new concept of attributed graphs and show that the corresponding category is M,N-adhesive. As a consequence, we inherit all nice properties for M,N-adhesive systems such as the Local Church-Rosser Theorem, the Parallelism Theorem, and the Concurrency Theorem for this type of attributed graphs.

Related

• A new criterion for M, N-adhesivity, with an application to hierarchical graphs
• Towards M-Adhesive Categories based on Coalgebras and Comma Categories
• Parallelism and Concurrency Theorems for Rules with Nested Application Conditions
• Adhesive category theory for graph rewriting in Rocq
• n-Categories Admissible by n-graph