# Reachability Problems for Continuous Chemical Reaction Networks

Source: [Reachability Problems for Continuous Chemical Reaction Networks](<https://www.sota2.com/research/paper/68fa62111e209131ce9f7394>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T20:11:29.310Z

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

Published: 2015-08-17T19:43:50.000Z

## Abstract

Chemical reaction networks (CRNs) model the behavior of molecules in a well-mixed system. The emerging field of molecular programming uses CRNs not only as a descriptive tool, but as a programming language for chemical computation. Recently, Chen, Doty and Soloveichik introduced a new model of chemical kinetics, rate-independent continuous CRNs (CCRNs), to study the chemical computation of continuous functions. A fundamental question of a CRN is whether a state of the system is reachable through a sequence of reactions in the network. This is known as the reachability problem. In this paper, we investigate CCRN-REACH, the reachability problem for this model of chemical reaction networks. We show that, for continuous CRNs, constructing a path to a state of the network is computable in polynomial time. We also prove that a related problem, Sub-CCRN-REACH, is NP-complete.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1508.04125>)

[PDF](<https://arxiv.org/pdf/1508.04125.pdf>)