Reachability Problems for Continuous Chemical Reaction Networks

DOI10.1007/978-3-319-41312-9_1zbMath1476.68088arXiv1508.04125OpenAlexW2266064085MaRDI QIDQ2819133

Adam Case, Jack H. Lutz, D. M. Stull

Publication date: 28 September 2016

Published in: Natural Computing, Unconventional Computation and Natural Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1508.04125

zbMATH Keywords

reachabilityanalysis of algorithmscontinuous chemical reaction networks

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Classical flows, reactions, etc. in chemistry (92E20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Related Items (4)

Computing with chemical reaction networks: a tutorial ⋮ Polynomial time coverability analysis in discrete state chemical reaction network subclasses ⋮ Reachability Problems for Continuous Chemical Reaction Networks ⋮ Reachability analysis of low-order discrete state reaction networks obeying conservation laws

Cites Work

• Unnamed Item
• Strand algebras for DNA computing
• Computation with finite stochastic chemical reaction networks
• A structure to decide reachability in Petri nets
• Computation in networks of passively mobile finite-state sensors
• Parallel program schemata
• Reachability Problems for Continuous Chemical Reaction Networks
• Rate-independent computation in continuous chemical reaction networks
• Computation in networks of passively mobile finite-state sensors

This page was built for publication: Reachability Problems for Continuous Chemical Reaction Networks