1. Parallelism in AGREE Transformations
- Author
-
Andrea Corradini, Frédéric Prost, Dominique Duval, Leila Ribeiro, University of Pisa - Università di Pisa, Calculs Algébriques et Systèmes Dynamiques (CASYS), Laboratoire Jean Kuntzmann (LJK ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Institut National de Recherche en Informatique et en Automatique (Inria)-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), Laboratoire d'Informatique de Grenoble (LIG ), Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019]), and Universidade Federal do Rio Grande do Sul [Porto Alegre] (UFRGS)
- Subjects
Graph rewriting ,Theoretical computer science ,Computer science ,Computer Science (all) ,010102 general mathematics ,[INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO] ,Theoretical Computer Science ,0102 computer and information sciences ,01 natural sciences ,010201 computation theory & mathematics ,Graph (abstract data type) ,Embedding ,0101 mathematics ,[MATH.MATH-CT]Mathematics [math]/Category Theory [math.CT] - Abstract
International audience; The AGREE approach to graph transformation allows to specify rules that clone items of the host graph, controlling in a fine-grained way how to deal with the edges that are incident, but not matched, to the rewritten part of the graph. Here, we investigate in which ways cloning (with controlled embedding) may affect the dependencies between two rules applied to the same graph. We extend to AGREE the classical notion of parallel independence between the matches of two rules to the same graph, identifying sufficient conditions that guarantee that two rules can be applied in any order leading to the same result.
- Published
- 2016
- Full Text
- View/download PDF