Reachability problems for continuous chemical reaction networks
- 21 Downloads
Chemical reaction networks (CRNs) model the behavior of molecules in a well-mixed solution. 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 rate-independent continuous CRNs (CCRNs) to study the chemical computation of continuous functions. A fundamental question for any CRN model is reachability, the question whether a given target state is reachable from a given start state via a sequence of reactions (a path) in the network. In this paper, we investigate CCRN-REACH, the reachability problem for rate-independent continuous chemical reaction networks. Our main theorem is that, for CCRNs, deciding reachability—and constructing a path if there is one—is computable in polynomial time. This contrasts sharply with the known exponential space hardness of the reachability problem for discrete CRNs. We also prove that the related problem Sub-CCRN-REACH, which asks about reachability in a CCRN using only a given number of its reactions, is NP-complete.
KeywordsReachability Continuous chemical reaction networks Analysis of algorithms
We thank Tim McNicholl, Xiang Huang, Titus Klinge, and Jim Lathrop for useful discussions. We also thank three anonymous reviewers for detailed improvements to this paper.
This research was supported in part by National Science Foundation Grants 1247051 and 1545028. Part of the second author’s work was carried out while participating in the 2015 Focus Semester on Computability and Randomness at Heidelberg University. A preliminary version of part of this work was presented at the Fifteenth International Conference on Unconventional Computation and Natural Computation (UCNC 2016, Manchester, UK, July 11–15, 2016).
- Case A, Lutz JH, Stull DM (2016) Reachability problems for continuous chemical reaction networks. In: Proceedings of the 15th international conference unconventional computation and natural computation, pp 1–10Google Scholar
- Chen H-L, Doty D, Soloveichik D (2014) Rate-independent computation in continuous chemical reaction networks. In: ITCS 2014: proceedings of the 5th innovations in theoretical computer science conference, pp 313–326Google Scholar
- Kleinberg JM, Tardos É (2006) Algorithm design. Addison-Wesley, BostonGoogle Scholar
- Kosaraju SR (1982) Decidability of reachability in vector addition systems (preliminary version). In: STOC 1982. ACM, pp 267–281Google Scholar
- Leroux J (2012) Vector addition reachability problem (a simpler solution). In: The Alan turing centenary conference, volume 10 of EPiC series. EasyChair, pp 214–228Google Scholar
- Lipton RJ (1976) The reachability problem requires exponential space technical report. Yale University, New HavenGoogle Scholar
- Mayr EW(1981) An algorithm for the general Petri net reachability problem. In: STOC 1981. ACM, pp 238–246Google Scholar
- Sacerdote GS, Tenney RL (1977) The decidability of the reachability problem for vector addition systems (preliminary version). In: STOC 1977. ACM, pp 61–76Google Scholar