Attribution of Graphs by Composition of M, N-adhesive Categories.
Christoph Peuser, Annegret Habel · 2015
This paper continues the work onM,N -adhesive categories and shows some important constructions on these categories. We use these constructions for an alternative, short proof for theM,N -adhesiveness of partially labelled graphs. We further 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.