Skip to Main content Skip to Navigation
Journal articles

Parallel Independence in Attributed Graph Rewriting

Abstract : In order to define graph transformations by the simultaneous application of concurrent rules, we have adopted in previous work a structure of attributed graphs stable by unions. We analyze the consequences on parallel independence, a property that characterizes the possibility to resort to sequential rewriting. This property turns out to depend not only on the left-hand side of rules, as in algebraic approaches to graph rewriting, but also on their right-hand side. It is then shown that, of three possible definitions of parallel rewriting, only one is convenient in the light of parallel independence.
Document type :
Journal articles
Complete list of metadata
Contributor : Thierry Boy de la Tour Connect in order to contact the contributor
Submitted on : Tuesday, November 16, 2021 - 10:03:20 AM
Last modification on : Saturday, November 20, 2021 - 3:49:06 AM


Publisher files allowed on an open archive




Thierry Boy de la Tour. Parallel Independence in Attributed Graph Rewriting. Electronic Proceedings in Theoretical Computer Science, EPTCS, 2021, Proceedings 11th International Workshop on Computing with Terms and Graphs, 334, pp.62 - 77. ⟨10.4204/eptcs.334.5⟩. ⟨hal-03430188⟩



Les métriques sont temporairement indisponibles