{"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":1725862874319},"publisher-location":"Cham","reference-count":17,"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_8","type":"book-chapter","created":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T09:34:57Z","timestamp":1471080897000},"page":"114-134","source":"Crossref","is-referenced-by-count":3,"title":["Verifying Chemical Reaction Network Implementations: A Bisimulation Approach"],"prefix":"10.1007","author":[{"given":"Robert F.","family":"Johnson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qing","family":"Dong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik","family":"Winfree","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,14]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","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, 87\u2013102 (2008)","journal-title":"Distrib. Comput."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1017\/S0960129512000102","volume":"23","author":"L Cardelli","year":"2013","unstructured":"Cardelli, L.: Two-domain DNA strand displacement. Math. Struct. Comput. Sci. 23, 247\u2013271 (2013)","journal-title":"Math. Struct. Comput. Sci."},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"1","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\u201318 (2014)","journal-title":"BMC Syst. Biol."},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Csik\u00e1sz-Nagy, A.: The cell cycle switch computes approximate majority. Sci. Rep. 2 (2012)","DOI":"10.1038\/srep00656"},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1038\/nnano.2013.189","volume":"8","author":"YJ 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, 755\u2013762 (2013)","journal-title":"Nat. Nanotechnol."},{"key":"8_CR6","unstructured":"Dong, Q.: A bisimulation approach to verification of molecular implementations of formal chemical reaction networks. Master\u2019s thesis, Stony Brook University (2012)"},{"key":"8_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"8_CR8","unstructured":"Grun, C., Sarma, K., Wolfe, B., Shin, S.W., Winfree, E.: A domain-level DNA strand displacement reaction enumerator allowing arbitrary non-pseudoknotted secondary structures. CoRR (2015). http:\/\/arxiv.org\/abs\/1505.03738"},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.tcs.2015.06.033","volume":"632","author":"MR Lakin","year":"2016","unstructured":"Lakin, M.R., Stefanovic, D., Phillips, A.: Modular verification of chemical reaction network encodings via serializability analysis. Theor. Comput. Sci. 632, 21\u201342 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"3211","DOI":"10.1093\/bioinformatics\/btr543","volume":"27","author":"MR Lakin","year":"2011","unstructured":"Lakin, M.R., Youssef, S., Polo, F., Emmott, S., Phillips, A.: Visual DSD: a design and analysis tool for DNA strand displacement systems. Bioinformatics 27, 3211\u20133213 (2011)","journal-title":"Bioinformatics"},{"key":"8_CR11","volume-title":"Communication and Concurrency","author":"R Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall Inc., Upper Saddle River (1989)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-642-18305-8_12","volume-title":"DNA Computing and Molecular Programming","author":"L Qian","year":"2011","unstructured":"Qian, L., Soloveichik, D., Winfree, E.: Efficient turing-universal computation with DNA polymers. In: Sakakibara, Y., Mi, Y. (eds.) DNA 16 2010. LNCS, vol. 6518, pp. 123\u2013140. Springer, Heidelberg (2011)"},{"issue":"2","key":"8_CR13","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6(2), 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"WJ Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4, 177\u2013192 (1970)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR15","unstructured":"Shin, S.W., Thachuk, C., Winfree, E.: Verifying chemical reaction network implementations: a pathway decomposition approach. CoRR (2014). http:\/\/arxiv.org\/abs\/1411.0782"},{"key":"8_CR16","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. Nat. Acad. Sci. 107, 5393\u20135398 (2010)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"8_CR17","unstructured":"Srinivas, N.: Programming chemical kinetics: engineering dynamic reaction networks with DNA strand displacement. Ph.D. thesis, California Institute of Technology (2015)"}],"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_8","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_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319439938","9783319439945"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43994-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}