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

04/17/2019
by   Thierry Boy de la Tour, et al.
0

We address the problem of defining graph transformations by the simultaneous application of direct transformations even when these cannot be applied independently of each other. An algebraic approach is adopted, with production rules of the form LlK i I r R, called weak spans. A parallel coherent transformation is introduced and shown to be a conservative extension of the interleaving semantics of parallel independent direct transformations. A categorical construction of finitely attributed structures is proposed, in which parallel coherent transformations can be built in a natural way. These notions are introduced and illustrated on detailed examples.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/08/2019

Parallelism Theorem and Derived Rules for Parallel Coherent Transformations

An Independent Parallelism Theorem is proven in the theory of adhesive H...
research
02/04/2021

Parallel Independence in Attributed Graph Rewriting

In order to define graph transformations by the simultaneous application...
research
03/02/2023

Algebraic Monograph Transformations

Monographs are graph-like structures with directed edges of unlimited le...
research
01/07/2021

Enhanced Direct Delta Mush

Direct Delta Mush is a novel skinning deformation technique introduced b...
research
08/09/2018

A Set-Theoretic Framework for Parallel Graph Rewriting

We tackle the problem of attributed graph transformations and propose a ...
research
05/11/2022

Algebraic Presentation of Semifree Monads

Monads and their composition via distributive laws have many application...
research
09/02/2015

On Transitive Consistency for Linear Invertible Transformations between Euclidean Coordinate Systems

Transitive consistency is an intrinsic property for collections of linea...

Please sign up or login with your details

Forgot password? Click here to reset