{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T07:01:02Z","timestamp":1769842862545,"version":"3.49.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030268060","type":"print"},{"value":"9783030268077","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-26807-7_3","type":"book-chapter","created":{"date-parts":[[2019,7,29]],"date-time":"2019-07-29T23:18:04Z","timestamp":1564442284000},"page":"37-53","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Real-Time Equivalence of Chemical Reaction Networks and Analog Computers"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4815-6130","authenticated-orcid":false,"given":"Xiang","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2297-6712","authenticated-orcid":false,"given":"Titus H.","family":"Klinge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James I.","family":"Lathrop","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,24]]},"reference":[{"issue":"4","key":"3_CR1","doi-asserted-by":"publisher","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":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/978-3-319-66799-7_15","volume-title":"DNA Computing and Molecular Programming","author":"S Badelt","year":"2017","unstructured":"Badelt, S., Shin, S.W., Johnson, R.F., Dong, Q., Thachuk, C., Winfree, E.: A general-purpose CRN-to-DSD compiler with formal verification, optimization, and simulation capabilities. In: Brijder, R., Qian, L. (eds.) DNA 2017. LNCS, vol. 10467, pp. 232\u2013248. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66799-7_15"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-32589-2_23","volume-title":"Mathematical Foundations of Computer Science 2012","author":"O Bournez","year":"2012","unstructured":"Bournez, O., Fraigniaud, P., Koegler, X.: Computing with large populations using interactions. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 234\u2013246. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_23"},{"issue":"6","key":"3_CR4","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/3127496","volume":"64","author":"O Bournez","year":"2017","unstructured":"Bournez, O., Gra\u00e7a, D.S., Pouly, A.: Polynomial time corresponds to solutions of polynomial ordinary differential equations of polynomial length. J. ACM 64(6), 38 (2017)","journal-title":"J. ACM"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-41312-9_1","volume-title":"Unconventional Computation and Natural Computation","author":"A Case","year":"2016","unstructured":"Case, A., Lutz, J.H., Stull, D.M.: Reachability problems for continuous chemical reaction networks. In: Amos, M., Condon, A. (eds.) UCNC 2016. LNCS, vol. 9726, pp. 1\u201310. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41312-9_1"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-319-99429-1_15","volume-title":"Computational Methods in Systems Biology","author":"C Chalk","year":"2018","unstructured":"Chalk, C., Kornerup, N., Reeves, W., Soloveichik, D.: Composable rate-independent computation in continuous chemical reaction networks. In: \u010ce\u0161ka, M., \u0160afr\u00e1nek, D. (eds.) CMSB 2018. LNCS, vol. 11095, pp. 256\u2013273. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99429-1_15"},{"issue":"5","key":"3_CR7","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00446-015-0255-6","volume":"30","author":"HL Chen","year":"2017","unstructured":"Chen, H.L., Cummings, R., Doty, D., Soloveichik, D.: Speed faults in computation by chemical reaction networks. Distrib. Comput. 30(5), 373\u2013390 (2017)","journal-title":"Distrib. Comput."},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-32208-2_3","volume-title":"DNA Computing and Molecular Programming","author":"H-L Chen","year":"2012","unstructured":"Chen, H.-L., Doty, D., Soloveichik, D.: Deterministic function computation with chemical reaction networks. In: Stefanovic, D., Turberfield, A. (eds.) DNA 2012. LNCS, vol. 7433, pp. 25\u201342. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32208-2_3"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Chen, H.L., Doty, D., Soloveichik, D.: Rate-independent computation in continuous chemical reaction networks. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science, pp. 313\u2013326. ACM (2014)","DOI":"10.1145\/2554797.2554827"},{"key":"3_CR10","series-title":"Natural Computing Series","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. Natural Computing Series, pp. 543\u2013584. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-540-88869-7_27"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Doty, D.: Timing in chemical reaction networks. In: Proceedings of the 25th Symposium on Discrete Algorithms, pp. 772\u2013784 (2014)","DOI":"10.1137\/1.9781611973402.57"},{"key":"3_CR12","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195096705.001.0001","volume-title":"An Introduction to Nonlinear Chemical Dynamics: Oscillations, Waves, Patterns, and Chaos.","author":"IR Epstein","year":"1998","unstructured":"Epstein, I.R., Pojman, J.A.: An Introduction to Nonlinear Chemical Dynamics: Oscillations, Waves, Patterns, and Chaos. Oxford University Press, Oxford (1998)"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-319-67471-1_7","volume-title":"Computational Methods in Systems Biology","author":"F Fages","year":"2017","unstructured":"Fages, F., Le Guludec, G., Bournez, O., Pouly, A.: Strong turing completeness of continuous chemical reaction networks and compilation of mixed analog-digital programs. In: Feret, J., Koeppl, H. (eds.) CMSB 2017. LNCS, vol. 10545, pp. 108\u2013127. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67471-1_7"},{"key":"3_CR14","series-title":"Applied Mathematical Sciences","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03858-8","volume-title":"Foundations of Chemical Reaction Network Theory","author":"M Feinberg","year":"2019","unstructured":"Feinberg, M.: Foundations of Chemical Reaction Network Theory. AMS, vol. 202. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-03858-8"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/S0022-0000(70)80012-5","volume":"4","author":"PC Fischer","year":"1970","unstructured":"Fischer, P.C., Meyer, A.R., Rosenberg, A.L.: Time-restricted sequence generation. J. Comput. Syst. Sci. 4(1), 50\u201373 (1970)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4\u20135","key":"3_CR16","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1002\/malq.200310113","volume":"50","author":"DS Gra\u00e7a","year":"2004","unstructured":"Gra\u00e7a, D.S.: Some recent developments on shannon\u2019s general purpose analog computer. Math. Logic Q.: Math. Logic Q. 50(4\u20135), 473\u2013485 (2004)","journal-title":"Math. Logic Q.: Math. Logic Q."},{"issue":"5","key":"3_CR17","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1016\/S0885-064X(03)00034-7","volume":"19","author":"DS Gra\u00e7a","year":"2003","unstructured":"Gra\u00e7a, D.S., Costa, J.F.: Analog computers and recursive functions over the reals. J. Complex. 19(5), 644\u2013664 (2003)","journal-title":"J. Complex."},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Trans. Am. Math. Soc. 117, 285\u2013306 (1965)","journal-title":"Trans. Am. Math. Soc."},{"issue":"1","key":"3_CR19","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s11047-018-9706-x","volume":"18","author":"X Huang","year":"2019","unstructured":"Huang, X., Klinge, T.H., Lathrop, J.I., Li, X., Lutz, J.H.: Real-time computability of real numbers by chemical reaction networks. Nat. Comput. 18(1), 63\u201373 (2019)","journal-title":"Nat. Comput."},{"issue":"7","key":"3_CR20","doi-asserted-by":"publisher","first-page":"2976","DOI":"10.1063\/1.1678692","volume":"57","author":"TG Kurtz","year":"1972","unstructured":"Kurtz, T.G.: The relationship between stochastic and deterministic models for chemical reactions. J. Chem. Phys. 57(7), 2976\u20132978 (1972)","journal-title":"J. Chem. Phys."},{"issue":"1\u20134","key":"3_CR21","first-page":"337","volume":"20","author":"CE Shannon","year":"1941","unstructured":"Shannon, C.E.: Mathematical theory of the differential analyzer. Stud. Appl. Math. 20(1\u20134), 337\u2013354 (1941)","journal-title":"Stud. Appl. Math."},{"issue":"6","key":"3_CR22","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1109\/TEC.1962.5219459","volume":"EC\u201311","author":"H Yamada","year":"1962","unstructured":"Yamada, H.: Real-time computation and recursive functions not real-time computable. IRE Trans. Electron. Comput. EC\u201311(6), 753\u2013760 (1962)","journal-title":"IRE Trans. Electron. Comput."}],"container-title":["Lecture Notes in Computer Science","DNA Computing and Molecular Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26807-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,15]],"date-time":"2021-01-15T05:08:43Z","timestamp":1610687323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-26807-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030268060","9783030268077"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26807-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"24 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DNA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on DNA Computing and Molecular Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seattle, WA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dna2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/misl.cs.washington.edu\/events\/dna25\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}