Global transformations form a categorical framework adapting graph transformations to describe fully synchronous rule systems on a given data structure.In this work we focus on data structures that can be captured as presheaves and study the computational aspects of such synchronous rule systems.To obtain an online algorithm, a complete study of the sub-steps within each synchronous step is done at the semantic level.This leads to the definition of accretive rule systems and a local criterion to characterize these systems.Finally an online computation algorithm for theses systems is given.
@article{arxiv.2103.09636,
title = {Accretive Computation of Global Transformations},
author = {Alexandre Fernandez and Luidnel Maignan and Antoine Spicher},
journal= {arXiv preprint arXiv:2103.09636},
year = {2021}
}