Parallel rewriting of attributed graphs

Abstract 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.

[1]  Rachid Echahed,et al.  Parallel Graph Rewriting with Overlapping Rules , 2017, LPAR.

[2]  Gabriele Taentzer,et al.  Parallel High-Level Replacement Systems , 1997, Theor. Comput. Sci..

[3]  Donald Sannella,et al.  Foundations of Algebraic Specification and Formal Software Development , 2012, Monographs in Theoretical Computer Science. An EATCS Series.

[4]  Andrea Corradini,et al.  On the Essence of Parallel Independence for the Double-Pushout and Sesqui-Pushout Approaches , 2018, Graph Transformation, Specifications, and Nets.

[5]  Fernando Orejas,et al.  Symbolic Attributed Graphs for Attributed Graph Transformation , 2010, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[6]  Hartmut Ehrig,et al.  Parallel and Distributed Derivations in the Single-Pushout Approach , 1993, Theor. Comput. Sci..

[7]  Winfried Kurth,et al.  Relational Growth Grammars - A Parallel Graph Transformation Approach with Applications in Biology and Architecture , 2007, AGTIVE.

[8]  Martin Strecker,et al.  Verifying Graph Transformation Systems with Description Logics , 2018, ICGT.

[9]  Reiko Heckel,et al.  Algebraic Approaches to Graph Transformation - Part I: Basic Concepts and Double Pushout Approach , 1997, Handbook of Graph Grammars.

[10]  Hartmut Ehrig,et al.  Parallelism of Manipulations in Multidimensional Information Structures , 1976, MFCS.

[11]  Hélène Kirchner,et al.  PORGY: Strategy-Driven Interactive Transformation of Graphs , 2011, TERMGRAPH.

[12]  Rachid Echahed.  Inductively Sequential Term-Graph Rewrite Systems , 2008, ICGT.

[13]  Marko C. J. D. van Eekelen,et al.  Functional Programming and Parallel Graph Rewriting , 1993 .

[14]  Ugo Montanari,et al.  A model for distributed systems based on graph rewriting , 1987, JACM.

[15]  Hartmut Ehrig,et al.  Dynamic Abstract Data Types Based on Algebraic Graph Transformations , 1994, COMPASS/ADT.

[16]  Hans-Jörg Kreowski,et al.  Graph multiset transformation: a new framework for massively parallel computation inspired by DNA computing , 2011, Natural Computing.

[17]  Detlef Plump,et al.  Towards Graph Programs for Graph Algorithms , 2004, ICGT.

[18]  Detlef Plump,et al.  Confluence of Graph Transformation Revisited , 2005, Processes, Terms and Cycles.

[19]  Dominique Duval,et al.  Transformation of Attributed Structures with Cloning , 2014, FASE.

[20]  Thierry Boy de la Tour.  Parallelism Theorem and Derived Rules for Parallel Coherent Transformations , 2019, ArXiv.

[21]  Ivan Lanese,et al.  Synchronization Algebras with Mobility for Graph Transformations , 2005, FGUC.

[22]  Hans-Jörg Kreowski,et al.  A Simple Notion of Parallel Graph Transformation and Its Perspectives , 2018, Graph Transformation, Specifications, and Nets.

[23]  Joost Engelfriet,et al.  Node Replacement Graph Grammars , 1997, Handbook of Graph Grammars.

[24]  Jean-Christophe Janodet,et al.  Parallel Admissible Graph Rewriting , 1998, WADT.

[25]  Friedrich Otto,et al.  String-Rewriting Systems , 1993, Text and Monographs in Computer Science.

[26]  Michael Löwe.  Characterisation of Parallel Independence in AGREE-Rewriting , 2018, ICGT.

[27]  Annegret Habel,et al.  Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.

[28]  Andrea Corradini,et al.  AGREE - Algebraic Graph Rewriting with Controlled Embedding , 2014, ICGT.

[29]  Tobias Nipkow,et al.  Term rewriting and all that , 1998 .

[30]  Detlef Plump,et al.  From imperative to rule-based graph programs , 2017, J. Log. Algebraic Methods Program..

[31]  Christoph M. Hoffmann,et al.  Group-Theoretic Algorithms and Graph Isomorphism , 1982, Lecture Notes in Computer Science.

[32]  Hartmut Ehrig,et al.  Fundamentals of Algebraic Graph Transformation , 2006, Monographs in Theoretical Computer Science. An EATCS Series.

[33]  Detlef Plump.  Checking Graph-Transformation Systems for Confluence , 2010, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..