Complexity of the dynamics of reaction systems
From MaRDI portal
Publication:2417853
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 behavior 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.
Recommendations
Cites work
- m-asynchronous cellular automata: from fairness to quasi-fairness
- A Full Cellular Automaton to Simulate Predator-Prey Systems
- An excursion in reaction systems: from computer science to biology
- Ancestors, descendants, and gardens of Eden in reaction systems
- Combinatorics of life and death for reaction systems
- Complexity of model checking for reaction systems
- Computational complexity of finite asynchronous cellular automata
- Computing issues of asynchronous CA
- Cycles and global attractors of reaction systems
- Efficient simulation of reaction systems on graphics processing units
- Fixed points and attractors of reaction systems
- From one-dimensional to two-dimensional cellular automata
- Functional constructions between reaction systems and propositional logic
- Functions defined by reaction systems
- scientific article; zbMATH DE number 3888913 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3326575 (Why is no real title available?)
- Investigating dynamic causalities in reaction systems
- Local rule distributions, language complexity and non-uniform cellular automata
- Minimal and almost minimal reaction systems
- Non-uniform Cellular Automata
- On the complexity of occurrence and convergence problems in reaction systems
- On the computational complexity of finite cellular automata
- On the dynamical behaviour of linear higher-order cellular automata and its decidability
- Periodic orbits and dynamical complexity in cellular automata
- Reachability in resource-bounded reaction systems
- Reaction System Models for the Heat Shock Response
- Reaction systems
- Reaction systems and extremal combinatorics properties
- Shifting and Lifting of Cellular Automata
- Specialized predictor for reaction systems with context properties
- Surjective multidimensional cellular automata are non-wandering: a combinatorial proof
Cited in
(31)- On the complexity of occurrence and convergence problems in reaction systems
- Complex reaction kinetics in chemistry: a unified picture suggested by mechanics in physics
- Steady states of constrained reaction systems
- Functions and sequences generated by reaction systems
- Facilitation in reaction systems
- Simulation of reaction systems by the strictly minimal ones
- Controllability of reaction systems
- Theory of reaction automata: a survey
- Ranks of strictly minimal reaction systems induced by permutations
- Comparing reactions in reaction systems
- Complexity of local, global and universality properties in finite dynamical systems
- On the computational complexity of reaction systems, revisited
- Characterization and computation of ancestors in reaction systems
- Complexity of model checking for reaction systems
- Evolvability of reaction systems and the invisibility theorem
- Reachability in resource-bounded reaction systems
- Preimage problems for reaction systems
- On state accessibility in reaction systems
- Stability and chaos in reaction systems
- Note on simulation by strictly minimal reaction systems with limited resources
- Fixed points and attractors of reaction systems
- Extremal combinatorics of reaction systems
- Cycles and global attractors of reaction systems
- Computing preimages and ancestors in reaction systems
- Fixed points and attractors of reactantless and inhibitorless reaction systems
- Computational complexity of reversible reaction systems
- Functional equivalence and a cover relation for reaction systems
- Foundations of block-parallel automata networks
- Cycles and global attractors of reactantless and inhibitorless reaction systems
- Minimizing cycles in reaction systems
- Relational state transition dynamics
This page was built for publication: Complexity of the dynamics of reaction systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2417853)
