EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Organisation

22379 Generalised compositionality in graph transformation

Home Policy Brochure Browse Search User Area Contact Help

Ghamarian, A.H. and Rensink, A. (2012) Generalised compositionality in graph transformation. In: 6th International Conference on Graph Transformation (ICGT 2012), 24-29 Sep 2012, Bremen, Germany. pp. 234-248. Lecture Notes in Computer Science 7562. Springer Verlag. ISSN 0302-9743 ISBN 978-3-642-33653-9

Full text available as:

PDF (Publisher's version)

270 Kb

Official URL: http://dx.doi.org/10.1007/978-3-642-33654-6_16

Abstract

We present a notion of composition applying both to graphs and to rules, based on graph and rule interfaces along which they are glued. The current paper generalises a previous result in two different ways. Firstly, rules do not have to form pullbacks with their interfaces; this enables graph passing between components, meaning that components may “learn” and “forget” subgraphs through communication with other components. Secondly, composition is no longer binary; instead, it can be repeated for an arbitrary number of components.

Item Type:	Conference or Workshop Paper (Full Paper, Talk)
Research Group:	EWI-FMT: Formal Methods and Tools
Research Program:	CTIT-DSN: Dependable Systems and Networks
Research Project:	GRAIL: Graphs for the Abstract Interpretation of Languages
Uncontrolled Keywords:	Graph Transformation, Abstraction, Abstract Interpretation, State Space Exploration
ID Code:	22379
Status:	Published
Deposited On:	18 October 2012
Refereed:	Yes
International:	Yes
More Information:	statistics

Export this item as:

To correct this item please ask your editor

Repository Staff Only: edit this item