Abstract | ||
---|---|---|
Reaction systems are discrete dynamical systems inspired by bio-chemical processes, whose dynamical behaviour is expressed by set-theoretic operations on finite sets. Reaction systems thus provide a description of bio-chemical phenomena that complements the more traditional approaches, for instance those based on differential equations. A comprehensive list of decision problems about the dynamical behaviour of reaction systems (such as cycles and fixed/periodic points, attractors, and reachability) is provided along with the corresponding computational complexity, which ranges from tractable problems to PSPACE-complete problems. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1016/j.ic.2019.03.006 | Information and Computation |
Keywords | Field | DocType |
Reaction systems,Computational complexity,Natural computing,Discrete dynamical systems | Attractor,Differential equation,Discrete mathematics,Decision problem,Natural computing,Finite set,Algebra,Reachability,Dynamical systems theory,Mathematics,Computational complexity theory | Journal |
Volume | ISSN | Citations |
267 | 0890-5401 | 0 |
PageRank | References | Authors |
0.34 | 9 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
alberto dennunzio | 1 | 318 | 38.17 |
Enrico Formenti | 2 | 23 | 6.47 |
Luca Manzoni | 3 | 488 | 55.19 |
Antonio E. Porreca | 4 | 238 | 31.88 |