Computing with chemical reaction networks: a tutorial
From MaRDI portal
Publication:6150974
DOI10.1007/s11047-018-9723-9zbMath1530.68079arXiv1811.10361OpenAlexW2963856490WikidataQ128550236 ScholiaQ128550236MaRDI QIDQ6150974
Publication date: 9 February 2024
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.10361
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)
Related Items (2)
Molecular device design based on chemical reaction networks: state feedback controller, static pre-filter, addition gate control system and full-dimensional state observer ⋮ Facilitation in reaction systems
Cites Work
- Deterministic function computation with chemical reaction networks
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Computation with finite stochastic chemical reaction networks
- On the reachability problem for 5-dimensional vector addition systems
- Chemical mechanism structure and the coincidence of the stoichiometric and kinetie subspaces
- Lectures on Petri nets. 1: Basic models. Advances in Petri nets
- Speed faults in computation by chemical reaction networks
- A general-purpose CRN-to-DSD compiler with formal verification, optimization, and simulation capabilities
- The computational power of population protocols
- Verifying polymer reaction networks using bisimulation
- Minimal output unstable configurations in chemical reaction networks and deciders
- Dominance and deficiency for Petri nets and chemical reaction networks
- Polynomial differential equations compute all real computable functions on computable compact intervals
- Computation in networks of passively mobile finite-state sensors
- Fast computation by population protocols with a leader
- Verifying chemical reaction network implementations: a pathway decomposition approach
- Semigroups, Presburger formulas, and languages
- Parallel program schemata
- Reachability Problems for Continuous Chemical Reaction Networks
- Programming Discrete Distributions with Chemical Reaction Networks
- Chemical Reaction Network Designs for Asynchronous Logic Circuits
- Verifying Chemical Reaction Network Implementations: A Bisimulation Approach
- Probability 1 Computation with Chemical Reaction Networks
- Parallel and Scalable Computation and Spatial Dynamics with DNA-Based Chemical Reaction Networks on a Surface
- Rate-independent computation in continuous chemical reaction networks
- Thermodynamic Analysis of Interacting Nucleic Acid Strands
- An Algorithm for the General Petri Net Reachability Problem
- Leaderless Deterministic Chemical Reaction Networks
- Strong Turing Completeness of Continuous Chemical Reaction Networks and Compilation of Mixed Analog-Digital Programs
- Stochastic approach to chemical kinetics
- Mathematical Theory of the Differential Analyzer
- Stable leader election in population protocols requires linear time
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computing with chemical reaction networks: a tutorial
