Accretive Computation of Global Transformations
Abstract
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- March 2021
- DOI:
- 10.48550/arXiv.2103.09636
- arXiv:
- arXiv:2103.09636
- Bibcode:
- 2021arXiv210309636F
- Keywords:
-
- Computer Science - Distributed;
- Parallel;
- and Cluster Computing;
- Computer Science - Multiagent Systems;
- Mathematics - Category Theory;
- Nonlinear Sciences - Cellular Automata and Lattice Gases