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.

在本文中，我们介绍了基于图的反应系统，将其作为基于集合的反应系统的概括，这是一种新颖且经过充分研究的交互式计算模型。基于图的反应系统使我们可以引入一种新的图转换方法，该方法不基于传统的“剪切，添加和粘贴”方法，而是基于在从图2的“ Universe”图B中移动（在B上冲浪）的子图乙到的子图乙，内形成子图的轨迹乙。我们通过小案例研究来说明这种方法：逼近Sierpinski三角形，模拟有限自动机，实现两个最短路径算法以及模拟细胞自动机。最后，我们通过基于图的反应系统更“全局”地介绍了领土图浏览系统的概念。