M,N-Adhesive Transformation Systems

Annegret Habel; Detlef Plump

doi:10.1007/978-3-642-33654-6_15

M,N-Adhesive Transformation Systems

Annegret Habel, Detlef Plump

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

The categorical framework of M-adhesive transformation systems does not cover graph transformation with relabelling. Rules that relabel nodes are natural for computing with graphs, however, and are commonly used in graph transformation languages. In this paper, we generalise M-adhesive transformation systems to M,N-adhesive transformation systems, where N is a class of morphisms containing the vertical morphisms in double-pushouts. We show that the category of partially labelled graphs is M,N-adhesive, where M and N are the classes of injective and injective, undefinedness-preserving graph morphisms, respectively. We obtain the Local Church-Rosser Theorem and the Parallelism Theorem for graph transformation with relabelling and application conditions as instances of results which we prove at the abstract level of M,N-adhesive systems.

Original language	English
Title of host publication	Proc. 6th International Conference on Graph Transformations
Editors	Hartmut Ehrig, Gregor Engels, Hans-Joerg Kreowski, Grzegorz Rozenberg
Publisher	Springer
Pages	218-233
Number of pages	16
ISBN (Electronic)	978-3-642-33654-6
ISBN (Print)	978-3-642-33653-9
DOIs	https://doi.org/10.1007/978-3-642-33654-6_15
Publication status	Published - 2012

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	7562
ISSN (Print)	0302-9743

Access to Document

10.1007/978-3-642-33654-6_15Licence: Unspecified

http://www.cs.york.ac.uk/plasma/publications/pdf/HabelPlump.12a.pdfLicence: Unspecified

Cite this

@inproceedings{e4a08cf0b9d94a9e895fa405ea0df727,

title = "M,N-Adhesive Transformation Systems",

abstract = "The categorical framework of M-adhesive transformation systems does not cover graph transformation with relabelling. Rules that relabel nodes are natural for computing with graphs, however, and are commonly used in graph transformation languages. In this paper, we generalise M-adhesive transformation systems to M,N-adhesive transformation systems, where N is a class of morphisms containing the vertical morphisms in double-pushouts. We show that the category of partially labelled graphs is M,N-adhesive, where M and N are the classes of injective and injective, undefinedness-preserving graph morphisms, respectively. We obtain the Local Church-Rosser Theorem and the Parallelism Theorem for graph transformation with relabelling and application conditions as instances of results which we prove at the abstract level of M,N-adhesive systems.",

author = "Annegret Habel and Detlef Plump",

year = "2012",

doi = "10.1007/978-3-642-33654-6_15",

language = "English",

isbn = "978-3-642-33653-9",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "218--233",

editor = "Hartmut Ehrig and Gregor Engels and Hans-Joerg Kreowski and Grzegorz Rozenberg",

booktitle = "Proc. 6th International Conference on Graph Transformations",

address = "Germany",

}

M,N-Adhesive Transformation Systems. / Habel, Annegret; Plump, Detlef.
Proc. 6th International Conference on Graph Transformations . ed. / Hartmut Ehrig; Gregor Engels; Hans-Joerg Kreowski; Grzegorz Rozenberg. Springer, 2012. p. 218-233 (Lecture Notes in Computer Science; Vol. 7562).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - M,N-Adhesive Transformation Systems

AU - Habel, Annegret

AU - Plump, Detlef

PY - 2012

Y1 - 2012

N2 - The categorical framework of M-adhesive transformation systems does not cover graph transformation with relabelling. Rules that relabel nodes are natural for computing with graphs, however, and are commonly used in graph transformation languages. In this paper, we generalise M-adhesive transformation systems to M,N-adhesive transformation systems, where N is a class of morphisms containing the vertical morphisms in double-pushouts. We show that the category of partially labelled graphs is M,N-adhesive, where M and N are the classes of injective and injective, undefinedness-preserving graph morphisms, respectively. We obtain the Local Church-Rosser Theorem and the Parallelism Theorem for graph transformation with relabelling and application conditions as instances of results which we prove at the abstract level of M,N-adhesive systems.

AB - The categorical framework of M-adhesive transformation systems does not cover graph transformation with relabelling. Rules that relabel nodes are natural for computing with graphs, however, and are commonly used in graph transformation languages. In this paper, we generalise M-adhesive transformation systems to M,N-adhesive transformation systems, where N is a class of morphisms containing the vertical morphisms in double-pushouts. We show that the category of partially labelled graphs is M,N-adhesive, where M and N are the classes of injective and injective, undefinedness-preserving graph morphisms, respectively. We obtain the Local Church-Rosser Theorem and the Parallelism Theorem for graph transformation with relabelling and application conditions as instances of results which we prove at the abstract level of M,N-adhesive systems.

UR - http://www.cs.york.ac.uk/plasma/publications/pdf/HabelPlump.12a.pdf

U2 - 10.1007/978-3-642-33654-6_15

DO - 10.1007/978-3-642-33654-6_15

M3 - Conference contribution

SN - 978-3-642-33653-9

T3 - Lecture Notes in Computer Science

SP - 218

EP - 233

BT - Proc. 6th International Conference on Graph Transformations

A2 - Ehrig, Hartmut

A2 - Engels, Gregor

A2 - Kreowski, Hans-Joerg

A2 - Rozenberg, Grzegorz

PB - Springer

ER -

M,N-Adhesive Transformation Systems

Abstract

Publication series

Access to Document

Other files and links

Cite this