Robustness of Expressivity in Chemical Reaction Networks
We show that some natural output conventions for error-free computation in chemical reaction networks (CRN) lead to a common level of computational expressivity. Our main results are that the standard definition of error-free CRNs have equivalent computational power to (1) asymmetric and (2) democratic CRNs. The former have only “yes” voters, with the interpretation that the CRN’s output is yes if any voters are present and no otherwise. The latter define output by majority vote among “yes” and “no” voters.
Both results are proven via a generalized framework that simultaneously captures several definitions, directly inspired by a recent Petri net result of Esparza, Ganty, Leroux, and Majumder [CONCUR 2015]. These results support the thesis that the computational expressivity of error-free CRNs is intrinsic, not sensitive to arbitrary definitional choices.
R.B. thanks Grzegorz Rozenberg for interesting and useful discussions regarding chemical reaction networks. D.D. thanks Ryan James for suggesting the democratic CRD model. The authors are grateful to the anonymous reviewers for comments that have helped improve the presentation.
- 1.Alistarh, D., Aspnes, J., Eisenstat, D., Gelashvili, R., Rivest, R.L.: Time-space trade-offs in population protocols. Technical report (2016). arXiv:1602.08032
- 2.Alistarh, D., Gelashvili, R.: Polylogarithmic-time leader election in population protocols. In: Halldórsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 479–491. Springer, Heidelberg (2015)Google Scholar
- 4.Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC 2006, pp. 292–299. ACM Press, New York (2006)Google Scholar
- 7.Brijder, R.: Output Stability and semilinear sets in chemical reaction networks and deciders. In: Murata, S., Kobayashi, S. (eds.) DNA 2014. LNCS, vol. 8727, pp. 100–113. Springer, Heidelberg (2014)Google Scholar
- 13.Esparza, J., Ganty, P., Leroux, J., Majumdar, R.: Verification of population protocols. In 26th International Conference on Concurrency Theory (CONCUR 2015), vol. 42, pp. 470–482 (2015)Google Scholar