Graph transformation through graph surfing in reaction systems

Abstract In this paper, we introduce graph-based reaction systems as a generalization of set-based reaction systems, a novel and well-investigated model of interactive computation. Graph-based reaction systems allow us to introduce a new methodology for graph transformation, which is not based on the traditional “cut, add, and paste” approach, but rather on moving within a “universe” graph B (surfing on B) from a subgraph of B to a subgraph of B, creating subgraph trajectories within B. We illustrate this approach by small case studies: approximating the Sierpinski triangle, simulating finite automata, implementing two shortest-paths algorithms, and simulating cellular automata. Finally, we introduce the notion of territorial graph surfing systems taking a more “global” look at graph-based reaction systems.

[1]  Arto Salomaa.  Functions and sequences generated by reaction systems , 2012, Theor. Comput. Sci..

[2]  Dietmar Saupe,et al.  Chaos and fractals - new frontiers of science , 1992 .

[3]  G. C. Shephard,et al.  Tilings and Patterns , 1990 .

[4]  Enrico Formenti,et al.  Fixed Points and Attractors of Reaction Systems , 2014, CiE.

[5]  Andrzej Ehrenfeucht,et al.  Reaction Systems , 2007, Fundam. Informaticae.

[6]  Andrzej Ehrenfeucht,et al.  A Tour of reaction Systems , 2011, Int. J. Found. Comput. Sci..

[7]  Ion Petre,et al.  Reaction Systems: A Model of Computation Inspired by the Functioning of the Living Cell , 2017, The Role of Theory in Computer Science.

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

[9]  Andrzej Ehrenfeucht,et al.  Functions Defined by Reaction Systems , 2011, Int. J. Found. Comput. Sci..

[10]  Nabila Abdessaied,et al.  Reversible and quantum circuits: optimization and complexity analysis , 2016 .

[11]  Andrzej Ehrenfeucht,et al.  Events and modules in reaction systems , 2007, Theor. Comput. Sci..

[12]  Andrzej Ehrenfeucht,et al.  Introducing time in reaction systems , 2009, Theor. Comput. Sci..

[13]  Hans-Jörg Kreowski,et al.  Graph Surfing by Reaction Systems , 2018, ICGT.

[14]  Arto Salomaa.  On State Sequences Defined by Reaction Systems , 2012, Logic and Program Semantics.

[15]  Grzegorz Rozenberg,et al.  Graph Grammars with Neighbourhood-Controlled Embedding , 1982, Theor. Comput. Sci..

[16]  Andrzej Ehrenfeucht,et al.  Zoom Structures and reaction Systems Yield Exploration Systems , 2014, Int. J. Found. Comput. Sci..

[17]  Jarkko Kari,et al.  Theory of cellular automata: A survey , 2005, Theor. Comput. Sci..

[18]  Grzegorz Rozenberg,et al.  Networks of Reaction Systems , 2020, Int. J. Found. Comput. Sci..

[19]  Andrzej Ehrenfeucht,et al.  Combinatorics of Life and Death for Reaction Systems , 2010, Int. J. Found. Comput. Sci..

[20]  Hartmut Ehrig,et al.  Introduction to the Algebraic Theory of Graph Grammars (A Survey) , 1978, Graph-Grammars and Their Application to Computer Science and Biology.

[21]  Hendrik Jan Hoogeboom,et al.  A graph isomorphism condition and equivalence of reaction systems , 2017, Theor. Comput. Sci..