On the public citation graph

Complexity of the dynamics of reaction systems

https://doi.org/10.1016/j.ic.2019.03.006
0 signed · 73 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1006/jcss.1995.1009openalex-snapshot
On the Computational Complexity of Finite Cellular Automata
inferredcites →https://doi.org/10.1007/11861201_52openalex-snapshot
A Full Cellular Automaton to Simulate Predator-Prey Systems
inferredcites →https://doi.org/10.1007/978-0-387-09680-3_11openalex-snapshot
Stable Dynamics of Sand Automata
inferredcites →https://doi.org/10.1007/978-3-319-08019-2_20openalex-snapshot
Fixed Points and Attractors of Reaction Systems
inferredcites →https://doi.org/10.1007/978-3-319-09704-6_11openalex-snapshot
Cycles and Global Attractors of Reaction Systems
inferredcites →https://doi.org/10.1007/978-3-319-30000-9_45openalex-snapshot
Reachability in Resource-Bounded Reaction Systems
inferredcites →https://doi.org/10.1007/978-3-540-73001-9openalex-snapshot
Computation and logic in the real world : Third Conference on Computability in Europe, CiE 2007 Siena, Italy, June 18-23, 2007 : proceedings
inferredcites →https://doi.org/10.1007/978-3-540-73001-9_1openalex-snapshot
Shifting and Lifting of Cellular Automata
inferredcites →https://doi.org/10.1007/978-3-642-00982-2_26openalex-snapshot
Non-uniform Cellular Automata
inferredcites →https://doi.org/10.1007/s11047-013-9372-yopenalex-snapshot
Minimal and almost minimal reaction systems
inferredcites →https://doi.org/10.1007/s11047-013-9386-5openalex-snapshot
m-Asynchronous cellular automata: from fairness to quasi-fairness
inferredcites →https://doi.org/10.1007/s11047-014-9456-3openalex-snapshot
On the complexity of occurrence and convergence problems in reaction systems
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/j.ins.2019.02.023openalex-snapshot
On the dynamical behaviour of linear higher-order cellular automata and its decidability
inferredcites →https://doi.org/10.1016/j.ipl.2012.12.009openalex-snapshot
Surjective multidimensional cellular automata are non-wandering: A combinatorial proof
inferredcites →https://doi.org/10.1016/j.tcs.2012.04.003openalex-snapshot
An excursion in reaction systems: From computer science to biology
inferredcites →https://doi.org/10.1016/j.tcs.2012.05.013openalex-snapshot
Local rule distributions, language complexity and non-uniform cellular automata
inferredcites →https://doi.org/10.1016/j.tcs.2015.05.046openalex-snapshot
Ancestors, descendants, and gardens of Eden in reaction systems
inferredcites →https://doi.org/10.1016/j.tcs.2015.06.001openalex-snapshot
Reaction systems and extremal combinatorics properties
inferredcites →https://doi.org/10.1016/j.tcs.2015.11.027openalex-snapshot
Descriptional Complexity of Formal Systems
inferredcites →https://doi.org/10.1016/j.tcs.2015.11.040openalex-snapshot
Complexity of model checking for reaction systems
inferredcites →https://doi.org/10.1016/j.tcs.2015.11.041openalex-snapshot
Investigating dynamic causalities in reaction systems
inferredcites →https://doi.org/10.1016/j.tcs.2015.12.003openalex-snapshot
Computational complexity of finite asynchronous cellular automata
inferredcites →https://doi.org/10.1038/nrg1471openalex-snapshot
Biological robustness
inferredcites →https://doi.org/10.1109/jproc.2002.804686openalex-snapshot
From Boolean to probabilistic Boolean networks as models of genetic regulatory networks
inferredcites →https://doi.org/10.1142/s0129054110007295openalex-snapshot
COMBINATORICS OF LIFE AND DEATH FOR REACTION SYSTEMS
inferredcites →https://doi.org/10.1142/s0129054111007927openalex-snapshot
FUNCTIONS DEFINED BY REACTION SYSTEMS
inferredcites →https://doi.org/10.1142/s0129054113500044openalex-snapshot
FUNCTIONAL CONSTRUCTIONS BETWEEN REACTION SYSTEMS AND PROPOSITIONAL LOGIC
inferredcites →https://doi.org/10.1371/journal.pone.0061757openalex-snapshot
A Comprehensive, Multi-Scale Dynamical Model of ErbB Receptor Signal Transduction in Human Mammary Epithelial Cells
inferredcites →https://doi.org/10.2307/2318039openalex-snapshot
Elementary Number Theory.
inferredcites →https://doi.org/10.2307/2318143openalex-snapshot
Elementary Number Theory.
inferredcites →https://doi.org/10.3233/fi-2012-642openalex-snapshot
From One-dimensional to Two-dimensional Cellular Automata
inferredcites →https://doi.org/10.3233/fi-2012-755openalex-snapshot
Computing Issues of Asynchronous CA
inferredcites →https://doi.org/10.3233/fi-2013-877openalex-snapshot
Periodic Orbits and Dynamical Complexity in Cellular Automata
inferredcites →https://doi.org/10.3233/fi-2014-1016openalex-snapshot
Reaction System Models for the Heat Shock Response
inferredcites →https://doi.org/10.3233/fi-2016-1403openalex-snapshot
Specialized Predictor for Reaction Systems with Context Properties
inferredcites →https://doi.org/10.3233/fi-2017-1568openalex-snapshot
Efficient Simulation of Reaction Systems on Graphics Processing Units
inferredcites →https://doi.org/10.3390/e19020061openalex-snapshot
Computational Complexity

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.5281/zenodo.23097936zenodo-depositor-declared
inferred← citeshttps://doi.org/10.1002/9781119716600.ch6openalex-snapshot
Boolean Networks and Their Dynamics: The Impact of Updates
inferred← citeshttps://doi.org/10.1002/9781394229086.ch5openalex-snapshot
Boolean Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_10openalex-snapshot
On the Computational Complexity of Reaction Systems, Revisited
inferred← citeshttps://doi.org/10.1007/978-3-031-13502-6_1openalex-snapshot
Complexity of Local, Global and Universality Properties in Finite Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-38100-3_4openalex-snapshot
Computational Complexity of Reversible Reaction Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_31openalex-snapshot
Combinatorics of Block-Parallel Automata Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-63742-1_17openalex-snapshot
Minimizing Cycles in Reaction Systems
inferred← citeshttps://doi.org/10.1007/s00354-022-00166-2openalex-snapshot
Monotone Control of R Systems
inferred← citeshttps://doi.org/10.1007/s11047-024-09973-6openalex-snapshot
Ranks of functions specified by minimal reaction systems and induced by images of singletons
inferred← citeshttps://doi.org/10.1007/s11047-024-09977-2openalex-snapshot
Fixed points and attractors of additive reaction systems
inferred← citeshttps://doi.org/10.1007/s11047-024-09986-1openalex-snapshot
On the spectrum between reaction systems and string rewriting
inferred← citeshttps://doi.org/10.1007/s11047-024-09989-yopenalex-snapshot
Reaction mining for reaction systems
inferred← citeshttps://doi.org/10.1007/s11047-025-10037-6openalex-snapshot
The busy beaver game for reaction systems
inferred← citeshttps://doi.org/10.1007/s11047-025-10044-7openalex-snapshot
Model checking for distributed reaction systems with temporal-epistemic properties
inferred← citeshttps://doi.org/10.1007/s11047-026-10077-6openalex-snapshot
A theoretical biology framework for exploring the behavioral extensibility of reaction systems
inferred← citeshttps://doi.org/10.1007/s41965-020-00042-2openalex-snapshot
Simulation of reaction systems by the strictly minimal ones
inferred← citeshttps://doi.org/10.1007/s41965-020-00044-0openalex-snapshot
Facilitation in reaction systems
inferred← citeshttps://doi.org/10.1007/s41965-020-00055-xopenalex-snapshot
Controllability of reaction systems
inferred← citeshttps://doi.org/10.1007/s41965-021-00070-6openalex-snapshot
Theory of reaction automata: a survey
inferred← citeshttps://doi.org/10.1007/s41965-024-00175-8openalex-snapshot
Restricted reaction system ranks of some union-additive functions
inferred← citeshttps://doi.org/10.1016/j.swevo.2026.102287openalex-snapshot
A novel bio-inspired encoding for evolving cryptographic Boolean functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.11.050openalex-snapshot
Comparing reactions in reaction systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.12.015openalex-snapshot
Ranks of strictly minimal reaction systems induced by permutations
inferred← citeshttps://doi.org/10.1016/j.tcs.2022.03.039openalex-snapshot
Evolvability of reaction systems and the invisibility theorem
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114322openalex-snapshot
Fixed points and attractors of reactantless and inhibitorless reaction systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114633openalex-snapshot
Functional equivalence and a cover relation for reaction systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115300openalex-snapshot
Cycles and global attractors of reactantless and inhibitorless reaction systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115572openalex-snapshot
Foundations of block-parallel automata networks
inferred← citeshttps://doi.org/10.3233/fi-2020-1878openalex-snapshot
The Many Roads to the Simulation of Reaction Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1808.10240openalex-snapshot
Most Permissive Semantics of Boolean Networks
inferred← citeshttps://doi.org/10.48550/arxiv.2006.09863openalex-snapshot
Ranks of Strictly Minimal Reaction Systems Induced by Permutations and Cartesian Product
inferred← citeshttps://doi.org/10.64898/2026.03.01.703722openalex-snapshot
Why Boolean network control tools disagree: a taxonomy of control problems
inferred← citeshttps://doi.org/10.70675/0d01e591z83a8z4dd0zbaebza6289f1eb727openalex-snapshot
Synthesis of Boolean Networks from the Structure and Dynamics of Reaction Networks
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.