Parallel rewriting of attributed graphs - Université Grenoble Alpes Accéder directement au contenu
Article Dans Une Revue Theoretical Computer Science Année : 2020

Parallel rewriting of attributed graphs

Thierry Boy de La Tour
  • Fonction : Auteur
  • PersonId : 1022935
Rachid Echahed

Résumé

Some computations can be elegantly presented as the parallel or simultaneous application of rules. This is the case of cellular automata and of simultaneous assignments in Python. In both cases the expected result cannot be obtained by a sequential application of rules. A general framework of attributed graph transformations is proposed where such computations can be expressed and analyzed. Determinism is achieved by an exhaustive parallel application of rules, as in cellular automata that are shown to have a straightforward representation in this framework. A more concise parallel transformation is also proposed, where some applications of rules can be ignored thanks to their symmetries, while preserving determinism. Parallel transformations are then used to characterize the property of parallel independence.
Fichier principal
Vignette du fichier
hal-version.pdf (485.55 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03430149 , version 1 (19-11-2021)

Identifiants

Citer

Thierry Boy de La Tour, Rachid Echahed. Parallel rewriting of attributed graphs. Theoretical Computer Science, 2020, 848, pp.106 - 132. ⟨10.1016/j.tcs.2020.09.025⟩. ⟨hal-03430149⟩
109 Consultations
54 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More