Graph Surfing in Reaction Systems from a Categorial Perspective

by   Hans-Jörg Kreowski, et al.

Graph-based reaction systems were recently introduced as a generalization of the intensely studied set-based reaction systems. They deal with simple edge-labeled directed graphs, and dynamic semantics of graph-based reaction systems is defined by graph surfing as a novel kind of graph transformation where, in a single surf step, reactions are applied to a subgraph of a given background graph yielding a successor subgraph. In this paper, we propose a categorical approach to reaction systems so that a wider spectrum of data structures becomes available on which reaction systems can be based. In this way, many types of graphs, hypergraphs, and graph-like structures are covered.



page 1

page 2

page 3

page 4


b-articulation points and b-bridges in strongly biconnected directed graphs

A directed graph G=(V,E) is called strongly biconnected if G is strongly...

Automaton of molecular perceptions in biochemical reactions

Local interactions among biomolecules, and the role played by their envi...

Simulation Of Reaction Systems By The Strictly Minimal Ones

Reaction systems, introduced by Ehrenfeucht and Rozenberg, are elementar...

SOS Rules for Equivalences of Reaction Systems

Reaction Systems (RSs) are a successful computational framework inspired...

High-performance symbolic-numerics via multiple dispatch

As mathematical computing becomes more democratized in high-level langua...

Controllability of reaction systems

Controlling a dynamical system is the ability of changing its configurat...

Computing Crisp Simulations and Crisp Directed Simulations for Fuzzy Graph-Based Structures

Like bisimulations, simulations and directed simulations are used for an...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.