Speed faults in computation by chemical reaction networks
Chemical reaction networks (CRNs) formally model chemistry in a well-mixed solution. Assuming a fixed molecular population size and bimolecular reactions, CRNs are formally equivalent to population protocols, a model of distributed computing introduced by Angluin, Aspnes, Diamadi, Fischer, and Peralta (PODC 2004). The challenge of fast computation by CRNs (or population protocols) is to not rely on a bottleneck “slow” reaction that requires two molecules (agent states) to react (communicate), both of which are present in low (O(1)) counts. It is known that CRNs can be fast in expectation by avoiding slow reactions with high probability. However, states may be reachable from which the correct answer may only be computed by executing a slow reaction. We deem such an event a speed fault. We show that the predicates stably decidable by CRNs guaranteed to avoid speed faults are precisely the detection predicates: Boolean combinations of questions of the form “is a certain species present or not?”. This implies, for instance, that no speed fault free CRN decides whether there are at least two molecules of a certain species—i.e., speed fault free CRNs “can’t count”.
We thank Damien Woods, Anne Condon, Chris Thachuk, Bonnie Kirkpatrick, Monir Hajiaghayi, and Ján Maňuch for useful discussions. We are also grateful to anonymous reviewers for pointing out a number of issues in the original version of this manuscript.
- 2.Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: PODC 2006: Proceedings of the Twenty-fifth Annual ACM Symposium on Principles of Distributed Computing, pp. 292–299, New York, NY, USA. ACM Press (2006)Google Scholar
- 5.Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Principles of Distributed Systems, pp. 103–117. Springer, Berlin (2006)Google Scholar
- 8.Cardelli, L., Csikász-Nagy, A.: The cell cycle switch computes approximate majority. Sci. Rep. 2, Article no. 656 (2012). doi: 10.1038/srep00656
- 9.Cardoza, E., Lipton, R., Meyer, Albert, R.: Exponential space complete problems for Petri nets and commutative semigroups (preliminary report). In: STOC 1976: Proceedings of the 8th annual ACM Symposium on Theory of Computing, pp. 50–54. ACM (1976)Google Scholar
- 10.Chen, H-L., Cummings, R., Doty, D., Soloveichik, D.: Speed faults in computation by chemical reaction networks. In: Kuhn, F. (ed.) DISC 2014: Proceedings of the 28th International Symposium on Distributed Computing, Austin, TX, USA, October 12–15, 2014. Lecture Notes in Computer Science, vol. 8784, pp. 16–30. Springer, Berlin (2014)Google Scholar
- 15.Cummings, R., Doty, D., Soloveichik, D.: Probability 1 computation with chemical reaction networks. In: DNA Computing and Molecular Programming, pp. 37–52. Springer, Berlin (2014)Google Scholar
- 17.Doty, D.: Timing in chemical reaction networks. In: SODA 2014: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 772–784 (2014)Google Scholar
- 19.Doty, D., Soloveichik, D.: Stable leader election in population protocols requires linear time. In: DISC 2015: Proceedings of the 29th International Symposium on Distributed Computing, Tokyo, Japan (2015)Google Scholar
- 23.Leroux, J.: Vector addition systems reachability problem (a simpler solution). In: The Alan Turing Centenary Conference, pp. 214–228 (2012)Google Scholar
- 24.Petri, C.A.: Communication with automata. Technical report, DTIC Document (1966)Google Scholar