{'fraction_non_alphanumeric': 0.009164969450101833, 'fraction_numerical': 0.0, 'mean_word_length': 5.341935483870968, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Global Graph Transformations

In this paper, we consider Global Graph Transformations where all occurrences of a set of predefined local rules are applied altogether synchronously so that each part of the original graph gives rise to a part of the result graph, without any reference to the original one. The particularity here is that our framework is deterministic. This is achieved by incorporating a notion of mutual agreement between its local rules. Our proposition is first motivated and illustrated on existing problems coming from different domains. It is then formalized as a categorical construction which is finally compared to more usual algebraic constructions, in particular to the strongly related Amalgamation Theorem. 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.