Parallel Independence in Attributed Graph Rewriting

TL;DR

This paper investigates parallel independence in attributed graph rewriting, revealing its dependence on both rule sides and identifying the most suitable definition of parallel rewriting for this property.

Contribution

It introduces an analysis of parallel independence considering both sides of rewriting rules and determines the most appropriate parallel rewriting definition.

Findings

Parallel independence depends on both left and right sides of rules.

Only one of three parallel rewriting definitions aligns well with parallel independence.

The study clarifies conditions for concurrent graph transformations.

Abstract

In order to define graph transformations by the simultaneous application of concurrent rules, we have adopted in previous work a structure of attributed graphs stable by unions. We analyze the consequences on parallel independence, a property that characterizes the possibility to resort to sequential rewriting. This property turns out to depend not only on the left-hand side of rules, as in algebraic approaches to graph rewriting, but also on their right-hand side. It is then shown that, of three possible definitions of parallel rewriting, only one is convenient in the light of parallel independence.