Corpus ID: 232257694

Accretive Computation of Global Transformations of Graphs

@article{Fernandez2021AccretiveCO,
  title={Accretive Computation of Global Transformations of Graphs},
  author={Alexandre Fernandez and Luidnel Maignan and Antoine Spicher},
  journal={ArXiv},
  year={2021},
  volume={abs/2103.09636}
}
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

References

SHOWING 1-10 OF 13 REFERENCES
Global Graph Transformations
Lindenmayer Systems and Global Transformations
Parallel Graph Rewriting with Overlapping Rules
A Set-Theoretic Framework for Parallel Graph Rewriting
Cellular automata over generalized Cayley graphs
GPaR: A Parallel Graph Rewriting Tool
Generation of Sierpinski Triangles: A Case Study for Graph Transformation Tools
Cellular Automata and Kan Extensions
The Bicategory of Open Functors
...
1
2
...