Parallel Graph Rewriting with Overlapping Rules

  title={Parallel Graph Rewriting with Overlapping Rules},
  author={R. Echahed and A. Maignan},
We tackle the problem of simultaneous transformations of networks represented as graphs. Roughly speaking, one may distinguish two kinds of simultaneous or parallel rewrite relations over complex structures such as graphs: (i) those which transform disjoint subgraphs in parallel and hence can be simulated by successive mere sequential and local transformations and (ii) those which transform overlapping subgraphs simultaneously. In the latter situations, parallel transformations cannot be… Expand
A Set-Theoretic Framework for Parallel Graph Rewriting
This work tackles the problem of attributed graph transformations and proposes a new algorithmic approach for defining parallel graph transformations allowing overlaps by introducing some abstract operations over graph structures and defining two distinct full parallel graph rewrite relations. Expand
Rewriting Logic and Its Applications: 13th International Workshop, WRLA 2020, Virtual Event, October 20-22, 2020, Revised Selected Papers
This work defines two graph transformations, one by parallelizing graph rewrite rules, the other by taking quotients of graphs, based on the use of equivalence relations over graph items and offers a new way of performing simultaneous merging operations. Expand
Parallel rewriting of attributed graphs
A general framework of attributed graph transformations is proposed where such computations can be expressed and analyzed and 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. Expand
Accretive Computation of Global Transformations of Graphs
An algorithm is presented which computes online the global transformation of a finite graph in an accretive manner and a local criterion is given for a rule system to extend to a graph global transformation. Expand
GPaR: A Parallel Graph Rewriting Tool
  • Stéphane Despréaux, A. Maignan
  • Computer Science
  • 2018 20th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)
  • 2018
GPaR tackles the problem of overlapping matches and thus can be used in a large variety of rewriting problems including fractal systems and is compared to the performance of other tools on the Sierpinski triangle benchmark. Expand
D C ] 1 7 M ar 2 02 1 Accretive Computation of Global Transformations of Graphs
The framework of global transformations aims at describing synchronous rewriting systems on a given data structure. In this work we focus on the data structure of graphs. Global transformations ofExpand


Global Graph Transformations
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. Expand
Parallel rewriting of graphs through the pullback approach
  • Michel Bauderon
  • Computer Science, Mathematics
  • Electron. Notes Theor. Comput. Sci.
  • 1995
It is shown that a deterministic graph grammar can be described by a single rule which is called P -grammar and that this new framework provides a genuine definition of parallel rewriting. Expand
A Study in Parallel Rewriting Systems
This paper study systematically three basic classes of grammars incorporating parallel rewriting: Indian parallel Grammars, Russian parallel grammARS and L systems, and introduces new classes of rewriting systems ( ETOL [ k ] systems, ETOLIP systems and ETOLRP systems). Expand
Transformation of Attributed Structures with Cloning
This work provides a framework for graph transformations with cloning, uses attributed graphs and allows rules to change attributes and generalises the sesqui-pushout approach of graph transformation in the proposed general framework and gives appropriate conditions under which attributed structures can be transformed. Expand
Algebraic Approach to Single-Pushout Graph Transformation
  • M. Löwe
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1993
The whole theory for double-pushout transformations including sequential composition, parallel composition, and amalgamation can be reformulated and generalized in the new framework. Expand
Graph Multiset Transformation as a Framework for Massively Parallel Computation
In this paper, graph multiset transformation is introduced and studied as a novel type of parallel graph transformation. The basic idea is that graph transformation rules may be applied to all or atExpand
String-Rewriting Systems
This chapter provides formal definitions of string-rewriting systems and their induced reduction relations and Thue congruences and relies on Section 1.4 for basic definitions and notation for strings. Expand
Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations
The double-pushout approach to graph transformation, which was invented in the early 1970's, is introduced in the Handbook of Graph Grammars and Computing by Graph. Expand
Complete Sets of Reductions for Some Equational Theories
The extension of the Knuth-Bendtx algorithm has produced complete sets of reductions for free commutattve groups, commutative rings wtth umt, and distributive lattices. Expand
Term rewriting and all that
This chapter discusses abstract reduction systems, universal algebra, and Grobner bases and Buchberger's algorithm, and a bluffer's guide to ML Bibliography Index. Expand