{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:26Z","timestamp":1740109346882,"version":"3.37.3"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T00:00:00Z","timestamp":1442188800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T00:00:00Z","timestamp":1442188800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1049899"],"award-info":[{"award-number":["1049899"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["1217770"],"award-info":[{"award-number":["1217770"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["1019343"],"award-info":[{"award-number":["1019343"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1219274"],"award-info":[{"award-number":["1219274"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1162589"],"award-info":[{"award-number":["1162589"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000057","name":"National Institute of General Medical Sciences","doi-asserted-by":"publisher","award":["P50 GM081879"],"award-info":[{"award-number":["P50 GM081879"]}],"id":[{"id":"10.13039\/100000057","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["0832824"],"award-info":[{"award-number":["0832824"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["0832824"],"award-info":[{"award-number":["0832824"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1317694"],"award-info":[{"award-number":["1317694"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001868","name":"National Science Council Taiwan","doi-asserted-by":"publisher","award":["101-2221-E-002-122-MY3"],"award-info":[{"award-number":["101-2221-E-002-122-MY3"]}],"id":[{"id":"10.13039\/501100001868","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s00446-015-0255-6","type":"journal-article","created":{"date-parts":[[2015,9,14]],"date-time":"2015-09-14T10:18:08Z","timestamp":1442225888000},"page":"373-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Speed faults in computation by chemical reaction networks"],"prefix":"10.1007","volume":"30","author":[{"given":"Ho-Lin","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachel","family":"Cummings","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Doty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Soloveichik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,14]]},"reference":[{"key":"255_CR1","doi-asserted-by":"publisher","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., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18, 235\u2013253 (2006). Preliminary version appeared in PODC 2004","journal-title":"Distrib. Comput."},{"key":"255_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013299, New York, NY, USA. ACM Press (2006)","DOI":"10.1145\/1146381.1146425"},{"issue":"3","key":"255_CR3","doi-asserted-by":"publisher","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). Preliminary version appeared in DISC 2006","journal-title":"Distrib. Comput."},{"issue":"2","key":"255_CR4","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00446-008-0059-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. 21(2), 87\u2013102 (2008)","journal-title":"Distrib. Comput."},{"key":"255_CR5","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Principles of Distributed Systems, pp. 103\u2013117. Springer, Berlin (2006)","DOI":"10.1007\/11795490_10"},{"issue":"1","key":"255_CR6","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11047-010-9236-7","volume":"10","author":"L Cardelli","year":"2011","unstructured":"Cardelli, L.: Strand algebras for DNA computing. Nat. Comput. 10(1), 407\u2013428 (2011)","journal-title":"Nat. Comput."},{"issue":"1","key":"255_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1186\/1752-0509-8-84","volume":"8","author":"L Cardelli","year":"2014","unstructured":"Cardelli, L.: Morphisms of reaction networks that couple structure to function. BMC Syst. Biol. 8(1), 84 (2014)","journal-title":"BMC Syst. Biol."},{"key":"255_CR8","doi-asserted-by":"publisher","unstructured":"Cardelli, L., Csik\u00e1sz-Nagy, A.: The cell cycle switch computes approximate majority. Sci. Rep. 2, Article no. 656 (2012). doi:\n                    10.1038\/srep00656","DOI":"10.1038\/srep00656"},{"key":"255_CR9","doi-asserted-by":"crossref","unstructured":"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\u201354. ACM (1976)","DOI":"10.1145\/800113.803630"},{"key":"255_CR10","doi-asserted-by":"crossref","unstructured":"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\u201315, 2014. Lecture Notes in Computer Science, vol. 8784, pp. 16\u201330. Springer, Berlin (2014)","DOI":"10.1007\/978-3-662-45174-8_2"},{"issue":"4","key":"255_CR11","doi-asserted-by":"publisher","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."},{"issue":"10","key":"255_CR12","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1038\/nnano.2013.189","volume":"8","author":"Y-J Chen","year":"2013","unstructured":"Chen, Y.-J., Dalchau, N., Srinivas, N., Phillips, A., Cardelli, L., Soloveichik, D., Seelig, G.: Programmable chemical controllers made from DNA. Nat. Nanotechnol. 8(10), 755\u2013762 (2013)","journal-title":"Nat. Nanotechnol."},{"key":"255_CR13","first-page":"512","volume":"2","author":"A Condon","year":"2012","unstructured":"Condon, A., Hu, A., Ma\u0148uch, J., Thachuk, C.: Less haste, less waste: on recycling and its limits in strand displacement systems. J. R. Soc. Interface 2, 512\u2013521 (2012). Preliminary version appeared in DNA 2011","journal-title":"J. R. Soc. Interface"},{"key":"255_CR14","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-540-88869-7_27","volume-title":"Algorithmic Bioprocesses","author":"M Cook","year":"2009","unstructured":"Cook, M., Soloveichik, D., Winfree, E., Bruck, J.: Programmability of chemical reaction networks. In: Condon, A., Harel, D., Kok, J.N., Salomaa, A., Winfree, E. (eds.) Algorithmic Bioprocesses, pp. 543\u2013584. Springer, Berlin (2009)"},{"key":"255_CR15","doi-asserted-by":"crossref","unstructured":"Cummings, R., Doty, D., Soloveichik, D.: Probability 1 computation with chemical reaction networks. In: DNA Computing and Molecular Programming, pp. 37\u201352. Springer, Berlin (2014)","DOI":"10.1007\/978-3-319-11295-4_3"},{"issue":"4","key":"255_CR16","doi-asserted-by":"publisher","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(4), 413\u2013422 (1913)","journal-title":"Am. J. Math."},{"key":"255_CR17","doi-asserted-by":"crossref","unstructured":"Doty, D.: Timing in chemical reaction networks. In: SODA 2014: Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 772\u2013784 (2014)","DOI":"10.1137\/1.9781611973402.57"},{"issue":"2","key":"255_CR18","doi-asserted-by":"publisher","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). Preliminary version appeared in DNA 2013","journal-title":"Nat. Comput."},{"key":"255_CR19","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-662-48653-5_40"},{"issue":"25","key":"255_CR20","doi-asserted-by":"publisher","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."},{"key":"255_CR21","doi-asserted-by":"publisher","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. Theor. Comput. Sci. 8, 135\u2013159 (1979)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"255_CR22","doi-asserted-by":"publisher","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."},{"key":"255_CR23","unstructured":"Leroux, J.: Vector addition systems reachability problem (a simpler solution). In: The Alan Turing Centenary Conference, pp. 214\u2013228 (2012)"},{"key":"255_CR24","unstructured":"Petri, C.A.: Communication with automata. Technical report, DTIC Document (1966)"},{"issue":"4","key":"255_CR25","doi-asserted-by":"publisher","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":"255_CR26","doi-asserted-by":"publisher","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 (2010). Preliminary version appeared in DNA 2008","journal-title":"Proc. Natl. Acad. Sci."}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-015-0255-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-015-0255-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-015-0255-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-015-0255-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T14:59:32Z","timestamp":1589641172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-015-0255-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,14]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["255"],"URL":"https:\/\/doi.org\/10.1007\/s00446-015-0255-6","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2015,9,14]]},"assertion":[{"value":"5 February 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 September 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 September 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}