Parallel Independence in Attributed Graph Rewriting

by   Thierry Boy de la Tour, et al.

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.


page 1

page 2

page 3

page 4


True Parallel Graph Transformations: an Algebraic Approach Based on Weak Spans

We address the problem of defining graph transformations by the simultan...

A Set-Theoretic Framework for Parallel Graph Rewriting

We tackle the problem of attributed graph transformations and propose a ...

Independence number of intersection graphs of axis-parallel segments

We prove that for any triangle-free intersection graph of n axis-paralle...

Formalizing the Confluence of Orthogonal Rewriting Systems

Orthogonality is a discipline of programming that in a syntactic manner ...

Structured Parallel Programming Language Based on True Concurrency

Based on our previous work on algebraic laws for true concurrency, we de...

Algebraic Monograph Transformations

Monographs are graph-like structures with directed edges of unlimited le...

Attributed Relational SIFT-based Regions Graph (ARSRG): concepts and applications

Graphs are widely adopted tools for encoding information. Generally, the...

Please sign up or login with your details

Forgot password? Click here to reset