{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:18:13Z","timestamp":1725805093672},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319112947"},{"type":"electronic","value":"9783319112954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11295-4_7","type":"book-chapter","created":{"date-parts":[[2014,9,8]],"date-time":"2014-09-08T14:35:40Z","timestamp":1410186940000},"page":"100-113","source":"Crossref","is-referenced-by-count":4,"title":["Output Stability and Semilinear Sets in Chemical Reaction Networks and Deciders"],"prefix":"10.1007","author":[{"given":"Robert","family":"Brijder","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"7_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.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distributed Computing\u00a018(4), 235\u2013253 (2006)","journal-title":"Distributed Computing"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Stably computable predicates are semilinear. In: Ruppert, E., Malkhi, D. (eds.) Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing (PODC 2006), pp. 292\u2013299. ACM (2006)","DOI":"10.1145\/1146381.1146425"},{"issue":"4","key":"7_CR3","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. Distributed Computing\u00a020(4), 279\u2013304 (2007)","journal-title":"Distributed Computing"},{"key":"7_CR4","first-page":"98","volume":"93","author":"J. Aspnes","year":"2007","unstructured":"Aspnes, J., Ruppert, E.: An introduction to population protocols. Bulletin of the EATCS\u00a093, 98\u2013117 (2007)","journal-title":"Bulletin of the EATCS"},{"key":"7_CR5","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 18. LNCS, vol.\u00a07433, pp. 25\u201342. Springer, Heidelberg (2012)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Doty, D., Soloveichik, D.: Rate-independent computation in continuous chemical reaction networks. In: Naor, M. (ed.) Innovations in Theoretical Computer Science (ITCS 2014), pp. 313\u2013326. ACM (2014)","DOI":"10.1145\/2554797.2554827"},{"key":"7_CR7","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)"},{"key":"7_CR8","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"L.E. Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. American Journal of Mathematics\u00a035, 413\u2013422 (1913)","journal-title":"American Journal of Mathematics"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Doty, D.: Timing in chemical reaction networks. In: Chekuri, C. (ed.) Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), pp. 772\u2013784. SIAM (2014)","DOI":"10.1137\/1.9781611973402.57"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-01928-4_4","volume-title":"DNA Computing and Molecular Programming","author":"D. Doty","year":"2013","unstructured":"Doty, D., Hajiaghayi, M.: Leaderless deterministic chemical reaction networks. In: Soloveichik, D., Yurke, B. (eds.) DNA 2013. LNCS, vol.\u00a08141, pp. 46\u201360. Springer, Heidelberg (2013)"},{"issue":"2","key":"7_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"R.M. Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. Journal of Computer and System Sciences\u00a03(2), 147\u2013195 (1969)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR12","unstructured":"Leroux, J.: Vector addition systems reachability problem (a simpler solution). In: Voronkov, A. (ed.) Proceedings of the Alan Turing Centenary Conference (Turing-100). EPiC Series, vol.\u00a010, pp. 214\u2013228 (2012)"},{"key":"7_CR13","first-page":"238","volume-title":"Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC 1981)","author":"E.W. Mayr","year":"1981","unstructured":"Mayr, E.W.: An algorithm for the general Petri net reachability problem. In: Proceedings of the 13th Annual ACM Symposium on Theory of Computing (STOC 1981), pp. 238\u2013246. ACM, New York (1981)"},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/356698.356702","volume":"9","author":"J.L. Peterson","year":"1977","unstructured":"Peterson, J.L.: Petri nets. ACM Computing Surveys\u00a09(3), 223\u2013252 (1977)","journal-title":"ACM Computing Surveys"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-41660-6_24","volume-title":"In Search of Elegance in the Theory and Practice of Computation","author":"G.D. Plotkin","year":"2013","unstructured":"Plotkin, G.D.: A calculus of chemical systems. In: Tannen, V., Wong, L., Libkin, L., Fan, W., Tan, W.-C., Fourman, M. (eds.) Buneman Festschrift 2013. LNCS, vol.\u00a08000, pp. 445\u2013465. Springer, Heidelberg (2013)"},{"issue":"4","key":"7_CR16","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. Natural Computing\u00a07(4), 615\u2013633 (2008)","journal-title":"Natural Computing"},{"issue":"12","key":"7_CR17","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. Proceedings of the National Academy of Sciences\u00a0107(12), 5393\u20135398 (2010)","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"7_CR18","unstructured":"Stanley, R.P.: Enumerative Combinatorics, 2nd edn. Cambridge Studies in Advanced Mathematics, vol.\u00a01. Cambridge University Press (2011)"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1137\/0214019","volume":"14","author":"D.E. Willard","year":"1985","unstructured":"Willard, D.E.: New data structures for orthogonal range queries. SIAM Journal on Computing\u00a014(1), 232\u2013253 (1985)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"7_CR20","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/0020-0190(81)90117-4","volume":"13","author":"H. Yamasaki","year":"1981","unstructured":"Yamasaki, H.: On weak persistency of Petri nets. Information Processing Letters\u00a013(3), 94\u201397 (1981)","journal-title":"Information Processing Letters"}],"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-11295-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T20:37:28Z","timestamp":1558989448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-11295-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319112947","9783319112954"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11295-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}