{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T06:21:14Z","timestamp":1725862874471},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319439938"},{"type":"electronic","value":"9783319439945"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-43994-5_4","type":"book-chapter","created":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T09:34:57Z","timestamp":1471080897000},"page":"52-66","source":"Crossref","is-referenced-by-count":2,"title":["Robustness of Expressivity in Chemical Reaction Networks"],"prefix":"10.1007","author":[{"given":"Robert","family":"Brijder","sequence":"first","affiliation":[]},{"given":"David","family":"Doty","sequence":"additional","affiliation":[]},{"given":"David","family":"Soloveichik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,8,14]]},"reference":[{"unstructured":"Alistarh, D., Aspnes, J., Eisenstat, D., Gelashvili, R., Rivest, R.L.: Time-space trade-offs in population protocols. Technical report (2016). arXiv:1602.08032","key":"4_CR1"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/978-3-662-47666-6_38","volume-title":"Automata, Languages, and Programming","author":"D Alistarh","year":"2015","unstructured":"Alistarh, D., Gelashvili, R.: Polylogarithmic-time leader election in population protocols. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9135, pp. 479\u2013491. Springer, Heidelberg (2015)"},{"issue":"4","key":"4_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"doi-asserted-by":"crossref","unstructured":"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\u2013299. ACM Press, New York (2006)","key":"4_CR4","DOI":"10.1145\/1146381.1146425"},{"issue":"3","key":"4_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s00446-008-0067-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. Distrib. Comput. 21(3), 183\u2013199 (2008)","journal-title":"Distrib. Comput."},{"issue":"4","key":"4_CR6","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279\u2013304 (2007)","journal-title":"Distrib. Comput."},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-319-11295-4_7","volume-title":"DNA Computing and Molecular Programming","author":"R Brijder","year":"2014","unstructured":"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\u2013113. Springer, Heidelberg (2014)"},{"issue":"4","key":"4_CR8","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/s11047-013-9393-6","volume":"13","author":"H-L Chen","year":"2014","unstructured":"Chen, H.-L., Doty, D., Soloveichik, D.: Deterministic function computation with chemical reaction networks. Nat. Comput. 13(4), 517\u2013534 (2014)","journal-title":"Nat. Comput."},{"key":"4_CR9","first-page":"1","volume":"15","author":"R Cummings","year":"2015","unstructured":"Cummings, R., Doty, D., Soloveichik, D.: Probability 1 computation with chemical reaction networks. Nat. Comput. 15, 1\u201317 (2015)","journal-title":"Nat. Comput."},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with $$n$$ distinct prime factors. Am. J. Math. 35, 413\u2013422 (1913)","journal-title":"Am. J. Math."},{"issue":"2","key":"4_CR11","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/s11047-014-9435-8","volume":"14","author":"D Doty","year":"2015","unstructured":"Doty, D., Hajiaghayi, M.: Leaderless deterministic chemical reaction networks. Nat. Comput. 14(2), 213\u2013223 (2015)","journal-title":"Nat. Comput."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1007\/978-3-662-48653-5_40","volume-title":"Distributed Computing","author":"D Doty","year":"2015","unstructured":"Doty, D., Soloveichik, D.: Stable leader election in population protocols requires linear time. In: Moses, Y. (ed.) DISC 2015. LNCS, vol. 9363, pp. 602\u2013616. Springer, Heidelberg (2015)"},{"unstructured":"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\u2013482 (2015)","key":"4_CR13"},{"issue":"25","key":"4_CR14","doi-asserted-by":"crossref","first-page":"2340","DOI":"10.1021\/j100540a008","volume":"81","author":"DT Gillespie","year":"1977","unstructured":"Gillespie, D.T.: Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81(25), 2340\u20132361 (1977)","journal-title":"J. Phys. Chem."},{"issue":"2","key":"4_CR15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.2140\/pjm.1966.16.285","volume":"16","author":"S Ginsburg","year":"1966","unstructured":"Ginsburg, S., Spanier, E.H.: Semigroups, Presburger formulas, and languages. Pac. J. Math. 16(2), 285\u2013296 (1966)","journal-title":"Pac. J. Math."},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0304-3975(79)90041-0","volume":"8","author":"JE Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Pansiot, J.-J.: On the reachability problem for 5-dimensional vector addition systems. Theoret. Comput. Sci. 8, 135\u2013159 (1979)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"4_CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"4_CR18","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"GH Mealy","year":"1955","unstructured":"Mealy, G.H.: A method for synthesizing sequential circuits. Bell Syst. Tech. J. 34(5), 1045\u20131079 (1955)","journal-title":"Bell Syst. Tech. J."},{"key":"4_CR19","first-page":"129","volume":"34","author":"EF Moore","year":"1956","unstructured":"Moore, E.F.: Gedanken-experiments on sequential machines. Automata Stud. 34, 129\u2013153 (1956)","journal-title":"Automata Stud."},{"issue":"3","key":"4_CR20","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356698.356702","volume":"9","author":"JL Peterson","year":"1977","unstructured":"Peterson, J.L.: Petri nets. ACM Comput. Surv. 9(3), 223\u2013252 (1977)","journal-title":"ACM Comput. Surv."},{"issue":"4","key":"4_CR21","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1007\/s11047-008-9067-y","volume":"7","author":"D Soloveichik","year":"2008","unstructured":"Soloveichik, D., Cook, M., Winfree, E., Bruck, J.: Computation with finite stochastic chemical reaction networks. Nat. Comput. 7(4), 615\u2013633 (2008)","journal-title":"Nat. Comput."},{"issue":"12","key":"4_CR22","doi-asserted-by":"crossref","first-page":"5393","DOI":"10.1073\/pnas.0909380107","volume":"107","author":"D Soloveichik","year":"2010","unstructured":"Soloveichik, D., Seelig, G., Winfree, E.: DNA as a universal substrate for chemical kinetics. Proc. Natl. Acad. Sci. 107(12), 5393\u20135398 (2010)","journal-title":"Proc. Natl. Acad. Sci."}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43994-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:40:44Z","timestamp":1498336844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43994-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319439938","9783319439945"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43994-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}