AGREE -- Algebraic Graph Rewriting with Controlled Embedding (Long Version)

TL;DR

This paper introduces AGREE, an extension of algebraic graph rewriting that allows for controlled modification of embeddings during transformation, enabling more flexible cloning and connection management.

Contribution

It presents a novel algebraic graph rewriting framework that permits explicit control over how embeddings are altered during rule application.

Findings

Enables cloning with different embeddings

Supports removal of specific connections during rewriting

Extends existing algebraic approaches for greater flexibility

Abstract

The several algebraic approaches to graph transformation proposed in the literature all ensure that if an item is preserved by a rule, so are its connections with the context graph where it is embedded. But there are applications in which it is desirable, for example when cloning an item, to specify different embeddings for the original and for the copy. Therefore we propose a conservative extension of these approaches where a rule can specify how the embedding of a preserved item should be changed, typically by removing certain connections.