# Parallel Graph Rewriting with Overlapping Rules

## TL;DR

This paper investigates the complexities of parallel graph rewriting, especially when overlapping subgraphs are transformed simultaneously, and proposes conditions for ensuring the closure and confluence of such transformations.

## Contribution

It introduces and analyzes two parallel rewrite relations for graphs, providing conditions for their closure and confluence, advancing understanding of overlapping graph transformations.

## Key findings

- Proposed sufficient conditions for graph closure under parallel rewriting.
- Introduced two parallel rewrite relations: one deterministic, one non-functional.
- Established conditions for confluence in non-functional parallel rewriting.

## Abstract

We tackle the problem of simultaneous transformations of networks represented as graphs. Roughly speaking, one may distinguish two kinds of simultaneous or parallel rewrite relations over complex structures such as graphs: (i) those which transform disjoint subgraphs in parallel and hence can be simulated by successive mere sequential and local transformations and (ii) those which transform overlapping subgraphs simultaneously. In the latter situations, parallel transformations cannot be simulated in general by means of successive local rewrite steps. We investigate this last problem in the framework of overlapping graph transformation systems. As parallel transformation of a graph does not produce a graph in general, we propose first some sufficient conditions that ensure the closure of graphs by parallel rewrite relations. Then we mainly introduce and discuss two parallel rewrite relations over graphs. One relation is functional and thus deterministic, the other one is not functional for which we propose sufficient conditions which ensure its confluence.