3 citations · 8 across the 6 of their papers we have counts for
6 papers
Algebraic Monograph Transformations
Thierry Boy de la Tour
Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. The…
Parallel Independence in Attributed Graph Rewriting
Thierry Boy de la Tour
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…
Parallelism Theorem and Derived Rules for Parallel Coherent Transformations
Thierry Boy de la Tour
An Independent Parallelism Theorem is proven in the theory of adhesive HLR categories. It shows the bijective correspondence between sequential independent and parallel independent…
True Parallel Graph Transformations: an Algebraic Approach Based on Weak Spans
Thierry Boy de la Tour, Rachid Echahed
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…
A Set-Theoretic Framework for Parallel Graph Rewriting
Thierry Boy de la Tour, Rachid Echahed
We tackle the problem of attributed graph transformations and propose a new algorithmic approach for defining parallel graph transformations allowing overlaps. We start by introduc…
Solving Linear Constraints in Elementary Abelian p-Groups of Symmetries
Thierry Boy de la Tour, Mnacho Echenim
Symmetries occur naturally in CSP or SAT problems and are not very difficult to discover, but using them to prune the search space tends to be very challenging. Indeed, this usuall…