Drag Rewriting

TL;DR

This paper introduces a novel algebraic framework for graph rewriting called drag rewriting, which uses graphs with roots and sprouts and a new composition operator to extend existing rewriting models.

Contribution

The paper presents a new algebraic structure for graph rewriting based on drags, enabling more powerful and flexible rewriting mechanisms.

Findings

Drags have a rich algebraic structure with sums and products.

Drag rewriting extends graph, dag, and term rewriting models.

The framework offers a new approach to graph transformation.

Abstract

We present a new and powerful algebraic framework for graph rewriting, based on drags, a class of graphs enjoying a novel composition operator. Graphs are embellished with roots and sprouts, which can be wired together to form edges. Drags enjoy a rich algebraic structure with sums and products. Drag rewriting naturally extends graph rewriting, dag rewriting, and term rewriting models.