Corpus ID: 232257694

Accretive Computation of Global Transformations of Graphs

  title={Accretive Computation of Global Transformations of Graphs},
  author={Alexandre Fernandez and Luidnel Maignan and Antoine Spicher},
The framework of global transformations aims at describing synchronous rewriting systems on a given data structure. In this work we focus on the data structure of graphs. Global transformations of graphs are defined and a local criterion is given for a rule system to extend to a graph global transformation. Finally we present an algorithm, with its correction, which computes online the global transformation of a finite graph in an accretive manner. 

Figures from this paper


Global Graph Transformations
Applications of this work include the generalization of cellular automata and the clarification of some frameworks of complex systems modeling where the usual mutual exclusion of rule applications can be replaced by a concept of mutual agreement. Expand
Lindenmayer Systems and Global Transformations
Global transformations, a category-based formalism for capturing computing models which are simultaneously local, synchronous and deterministic, are introduced through the perspective ofExpand
Parallel Graph Rewriting with Overlapping Rules
This work mainly introduces and discusses two parallel rewrite relations over graphs, one of which is functional and thus deterministic, the other one is not functional for which it is proposed sufficient conditions which ensure its confluence. Expand
A Set-Theoretic Framework for Parallel Graph Rewriting
This work tackles the problem of attributed graph transformations and proposes a new algorithmic approach for defining parallel graph transformations allowing overlaps by introducing some abstract operations over graph structures and defining two distinct full parallel graph rewrite relations. Expand
Cellular automata over generalized Cayley graphs
A notion of graphs is proposed, which preserves or generalizes a number of useful features of Cayley graphs, and extends cellular automata theory to these arbitrary, bounded degree, time-varying graphs. Expand
GPaR: A Parallel Graph Rewriting Tool
  • Stéphane Despréaux, A. Maignan
  • Computer Science
  • 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
  • 2018
GPaR tackles the problem of overlapping matches and thus can be used in a large variety of rewriting problems including fractal systems and is compared to the performance of other tools on the Sierpinski triangle benchmark. Expand
Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools
A large variety of solutions for the generation of Sierpinski triangles are considered, one of the case studies for the AGTIVE graph transformation tool contest, involving the construction of all triangles up to a certain number of iterations. Expand
Cellular Automata and Kan Extensions
In this paper, we formalize precisely the sense in which the application of a cellular automaton to partial configurations is a natural extension of its local transition function through theExpand
The Bicategory of Open Functors
We want to replace categories, functors and natural transformations by categories, open functors and open natural transformations. In analogy with open dynamical systems, the adjective open is addedExpand
∞-Categories for the Working Mathematician
homotopy theory C.1. Lifting properties, weak factorization systems, and Leibniz closure C.1.1. Lemma. Any class of maps characterized by a right lifting property is closed under composition,Expand