Democratic, existential, and consensus-based output conventions in stable computation by chemical reaction networks
- 22 Downloads
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 consensus-based output convention have equivalent computational power to (1) existence-based and (2) democracy-based output conventions. The CRNs using the former output convention have only “yes” voters, with the interpretation that the CRN’s output is yes if any voters are present and no otherwise. The CRNs using the latter output convention 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 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.
KeywordsPopulation protocols Chemical reaction networks Stable computation Semilinear predicates
R.B. thanks Grzegorz Rozenberg for useful comments on an earlier version of this paper and for useful discussions regarding CRNs in general. D.D. thanks Ryan James for suggesting the democratic CRD model. The authors are grateful to anonymous reviewers for comments on a conference version of this paper and on an earlier version of this journal paper that have helped improve the presentation.
- Alistarh D, Gelashvili R (2015) Polylogarithmic-time leader election in population protocols. In: ICALP 2015: proceedings of the 42nd international colloquium on automata, languages, and programming, Kyoto, JapanGoogle Scholar
- Alistarh D, Aspnes J, Eisenstat D, Gelashvili R, Rivest RL (2016) Time-space trade-offs in population protocols. Technical Report. arXiv:1602.08032
- Alistarh D, Dudek B, Kosowski A, Soloveichik D, Uznański P (2017) Robust detection in leak-prone population protocols. Technical Report. arXiv:1706.09937
- Angluin D, Aspnes J, Eisenstat D (2006b) Stably computable predicates are semilinear. In: PODC 2006: proceedings of the 25th annual ACM symposium on principles of distributed computing, New York, NY, USA. ACM Press, pp 292–299Google Scholar
- Brijder R (2014) Output stability and semilinear sets in chemical reaction networks and deciders. In: DNA 20: proceedings of the 20th international meeting on DNA computing and molecular programming, pp 100–113Google Scholar
- Brijder R, Doty D, Soloveichik D (2016) Robustness of expressivity in chemical reaction networks. In: Rondelez Y, Woods D (eds) DNA 22: proceedings of the 22th international meeting on DNA computing and molecular programming, vol 9818 of lecture notes in computer science. Springer, pp 52–66Google Scholar
- Chen HL, Doty D, Soloveichik D (2014b) 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
- Doty D, Soloveichik D (2015) Stable leader election in population protocols requires linear time. In: DISC 2015: proceedings of the 29th international symposium on distributed computing, lecture notes in computer science. Springer, Berlin, pp 602–616Google Scholar
- Esparza J, Ganty P, Leroux J, Majumdar R (2015) Verification of population protocols. In: CONCUR 2015: 26th international conference on concurrency theory, vol 42, pp 470–482Google Scholar