{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:09:21Z","timestamp":1740136161539,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,10,4]],"date-time":"2017-10-04T00:00:00Z","timestamp":1507075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,10,4]],"date-time":"2017-10-04T00:00:00Z","timestamp":1507075200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1247051","1545028"],"award-info":[{"award-number":["1247051","1545028"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11047-017-9641-2","type":"journal-article","created":{"date-parts":[[2017,10,4]],"date-time":"2017-10-04T15:41:37Z","timestamp":1507131697000},"page":"223-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reachability problems for continuous chemical reaction networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Adam","family":"Case","sequence":"first","affiliation":[]},{"given":"Jack H.","family":"Lutz","sequence":"additional","affiliation":[]},{"given":"D. M.","family":"Stull","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,4]]},"reference":[{"issue":"4","key":"9641_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 MJ, Peralta R (2006) Computation in networks of passively mobile finite-state sensors. Distrib Comput 18(4):235\u2013253","journal-title":"Distrib Comput"},{"issue":"1","key":"9641_CR2","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11047-010-9236-7","volume":"10","author":"L Cardelli","year":"2011","unstructured":"Cardelli L (2011) Strand algebras for DNA computing. Nat Comput 10(1):407\u2013428","journal-title":"Nat Comput"},{"key":"9641_CR3","doi-asserted-by":"crossref","unstructured":"Case A, Lutz JH, Stull DM (2016) Reachability problems for continuous chemical reaction networks. In: Proceedings of the 15th international conference unconventional computation and natural computation, pp 1\u201310","DOI":"10.1007\/978-3-319-41312-9_1"},{"key":"9641_CR4","unstructured":"Chen H-L, Doty D, Soloveichik D (2014) Rate-independent computation in continuous chemical reaction networks. In: ITCS 2014: proceedings of the 5th innovations in theoretical computer science conference, pp 313\u2013326"},{"issue":"10","key":"9641_CR5","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 (2013) Programmable chemical controllers made from DNA. Nat Nanotechnol 8(10):755\u2013762","journal-title":"Nat Nanotechnol"},{"key":"9641_CR6","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-540-88869-7_27","volume-title":"Programmability of chemical reaction networks, Algorithmic bioprocesses","author":"M Cook","year":"2009","unstructured":"Cook M, Soloveichik D, Winfree E, Bruck J (2009) Programmability of chemical reaction networks, Algorithmic bioprocesses. Springer, Berlin, pp 543\u2013584"},{"key":"9641_CR7","doi-asserted-by":"publisher","first-page":"1183","DOI":"10.1126\/science.1070919","volume":"297","author":"MB Elowitz","year":"2002","unstructured":"Elowitz MB, Levine AJ, Siggia ED, Swain PS (2002) Stochastic gene expression in a single cell. Science 297:1183\u20131185","journal-title":"Science"},{"key":"9641_CR8","first-page":"143","volume":"3","author":"J Esparza","year":"1994","unstructured":"Esparza J, Nielsen M (1994) Decidability issues for Petri nets\u2014a survey. J Inform Process Cybern 3:143\u2013160","journal-title":"J Inform Process Cybern"},{"issue":"25","key":"9641_CR9","doi-asserted-by":"publisher","first-page":"2340","DOI":"10.1021\/j100540a008","volume":"81","author":"DT Gillespie","year":"1977","unstructured":"Gillespie DT (1977) Exact stochastic simulation of coupled chemical reactions. J Phys Chem 81(25):2340\u20132361","journal-title":"J Phys Chem"},{"issue":"3","key":"9641_CR10","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/MDT.2012.2192144","volume":"29","author":"H Jiang","year":"2012","unstructured":"Jiang H, Riedel M, Parhi K (2012) Digital signal processing with molecular reactions. IEEE Design Test Comput 29(3):21\u201331","journal-title":"IEEE Design Test Comput"},{"issue":"4","key":"9641_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp RM, Miller RE (1969) Parallel program schemata. J Comput Syst Sci 3(4):147\u2013195","journal-title":"J Comput Syst Sci"},{"key":"9641_CR12","volume-title":"Algorithm design","author":"JM Kleinberg","year":"2006","unstructured":"Kleinberg JM, Tardos \u00c9 (2006) Algorithm design. Addison-Wesley, Boston"},{"key":"9641_CR13","doi-asserted-by":"crossref","unstructured":"Kosaraju SR (1982) Decidability of reachability in vector addition systems (preliminary version). In: STOC 1982. ACM, pp 267\u2013281","DOI":"10.1145\/800070.802201"},{"issue":"1","key":"9641_CR14","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(92)90173-D","volume":"99","author":"JL Lambert","year":"1992","unstructured":"Lambert JL (1992) A structure to decide reachability in Petri nets. Theor Comput Sci 99(1):79\u2013104","journal-title":"Theor Comput Sci"},{"key":"9641_CR15","unstructured":"Leroux J (2012) Vector addition reachability problem (a simpler solution). In: The Alan turing centenary conference, volume 10 of EPiC series. EasyChair, pp 214\u2013228"},{"key":"9641_CR16","volume-title":"The reachability problem requires exponential space technical report","author":"RJ Lipton","year":"1976","unstructured":"Lipton RJ (1976) The reachability problem requires exponential space technical report. Yale University, New Haven"},{"key":"9641_CR17","doi-asserted-by":"crossref","unstructured":"Mayr EW(1981) An algorithm for the general Petri net reachability problem. In: STOC 1981. ACM, pp 238\u2013246","DOI":"10.1145\/800076.802477"},{"key":"9641_CR18","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1073\/pnas.94.3.814","volume":"94","author":"HH McAdams","year":"1997","unstructured":"McAdams HH, Arkin AP (1997) Stochastic mechanisms in gene expression. Proc Natl Acad Sci 94:814\u2013819","journal-title":"Proc Natl Acad Sci"},{"key":"9641_CR19","unstructured":"Sacerdote GS, Tenney RL (1977) The decidability of the reachability problem for vector addition systems (preliminary version). In: STOC 1977. ACM, pp 61\u201376"},{"issue":"4","key":"9641_CR20","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 (2008) Computation with finite stochastic chemical reaction networks. Nat Comput 7(4):615\u2013633","journal-title":"Nat Comput"},{"issue":"12","key":"9641_CR21","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1073\/pnas.0909380107","volume":"107","author":"D Soloveichik","year":"2010","unstructured":"Soloveichik D, Seelig G, Winfree E (2010) DNA as a universal substrate for chemical kinetics. Proc Natl Acad Sci 107(12):53\u201393","journal-title":"Proc Natl Acad Sci"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-017-9641-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-017-9641-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-017-9641-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,14]],"date-time":"2020-05-14T00:23:13Z","timestamp":1589415793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-017-9641-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,4]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["9641"],"URL":"https:\/\/doi.org\/10.1007\/s11047-017-9641-2","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"type":"print","value":"1567-7818"},{"type":"electronic","value":"1572-9796"}],"subject":[],"published":{"date-parts":[[2017,10,4]]},"assertion":[{"value":"4 October 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}