{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T20:08:47Z","timestamp":1693771727179},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,5,30]],"date-time":"2015-05-30T00:00:00Z","timestamp":1432944000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"FWO"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s11047-015-9506-5","type":"journal-article","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T22:50:01Z","timestamp":1432853401000},"page":"235-244","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Minimal output unstable configurations in chemical reaction networks and deciders"],"prefix":"10.1007","volume":"15","author":[{"given":"Robert","family":"Brijder","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,30]]},"reference":[{"issue":"4","key":"9506_CR1","doi-asserted-by":"crossref","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"},{"key":"9506_CR2","doi-asserted-by":"crossref","unstructured":"Angluin D, Aspnes J, Eisenstat D (2006) 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). ACM, pp 292\u2013299","DOI":"10.1145\/1146381.1146425"},{"issue":"4","key":"9506_CR3","doi-asserted-by":"crossref","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 (2007) The computational power of population protocols. Distrib Comput 20(4):279\u2013304","journal-title":"Distrib Comput"},{"key":"9506_CR4","first-page":"98","volume":"93","author":"J Aspnes","year":"2007","unstructured":"Aspnes J, Ruppert E (2007) An introduction to population protocols. Bull EATCS 93:98\u2013117","journal-title":"Bull EATCS"},{"key":"9506_CR5","doi-asserted-by":"crossref","unstructured":"Brijder R (2014) Output stability and semilinear sets in chemical reaction networks and deciders. In: Murata S, Kobayashi S (eds) Proceedings of the 20th international conference on DNA computing and molecular programming (DNA 20), volume 8727 of lecture notes in computer science. Springer, pp 100\u2013113","DOI":"10.1007\/978-3-319-11295-4_7"},{"key":"9506_CR6","doi-asserted-by":"crossref","unstructured":"Chen H-L, Doty D, Soloveichik D (2012) Deterministic function computation with chemical reaction networks. In: Stefanovic D, Turberfield AJ (eds) Proceedings of the 18th international conference on DNA computing and molecular programming (DNA 18), volume 7433 of lecture notes in computer science. Springer, pp 25\u201342","DOI":"10.1007\/978-3-642-32208-2_3"},{"key":"9506_CR7","doi-asserted-by":"crossref","unstructured":"Chen H-L, Doty D, Soloveichik D (2014) Rate-independent computation in continuous chemical reaction networks. In: Naor M (ed) Innovations in theoretical computer science (ITCS\u201914). ACM, pp 313\u2013326","DOI":"10.1145\/2554797.2554827"},{"key":"9506_CR8","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/978-3-540-88869-7_27","volume-title":"Algorithmic bioprocesses, natural computing series","author":"M Cook","year":"2009","unstructured":"Cook M, Soloveichik D, Winfree E, Bruck J (2009) Programmability of chemical reaction networks. In: Condon A, Harel D, Kok JN, Salomaa A, Winfree E (eds) Algorithmic bioprocesses, natural computing series. Springer, Berlin, pp 543\u2013584"},{"key":"9506_CR9","doi-asserted-by":"crossref","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson LE (1913) Finiteness of the odd perfect and primitive abundant numbers with $$n$$ n distinct prime factors. Am J Math 35:413\u2013422","journal-title":"Am J Math"},{"key":"9506_CR10","doi-asserted-by":"crossref","unstructured":"Doty D (2014) Timing in chemical reaction networks. In: Chekuri C (ed) Proceedings of the 25th annual ACM\u2013SIAM symposium on discrete algorithms (SODA 2014). SIAM, pp 772\u2013784","DOI":"10.1137\/1.9781611973402.57"},{"key":"9506_CR11","doi-asserted-by":"crossref","unstructured":"Doty D, Hajiaghayi M (2013) Leaderless deterministic chemical reaction networks. In: Soloveichik D, Yurke B (eds) Proceedings of the 19th international conference on DNA computing and molecular programming (DNA 19), volume 8141 of lecture notes in computer science. Springer, pp 46\u201360","DOI":"10.1007\/978-3-319-01928-4_4"},{"issue":"2","key":"9506_CR12","doi-asserted-by":"crossref","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(2):147\u2013195","journal-title":"J Comput Syst Sci"},{"key":"9506_CR13","unstructured":"Leroux J (2012) Vector addition systems reachability problem (a simpler solution). In: Voronkov A (ed) Proceedings of the Alan Turing centenary conference (Turing-100), volume 10 of EPiC series, pp 214\u2013228"},{"key":"9506_CR14","doi-asserted-by":"crossref","unstructured":"Mayr EW (1981) An algorithm for the general Petri net reachability problem. In: Proceedings of the 13th annual ACM symposium on theory of computing (STOC \u201981). ACM, New York, NY, USA, pp 238\u2013246","DOI":"10.1145\/800076.802477"},{"issue":"3","key":"9506_CR15","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1145\/356698.356702","volume":"9","author":"JL Peterson","year":"1977","unstructured":"Peterson JL (1977) Petri nets. ACM Comput Surv 9(3):223\u2013252","journal-title":"ACM Comput Surv"},{"key":"9506_CR16","doi-asserted-by":"crossref","unstructured":"Plotkin GD (2013) A calculus of chemical systems. In: Tannen V, Wong L, Libkin L, Fan W, Tan W-C, Fourman M (eds) In search of elegance in the theory and practice of computation, volume 8000 of lecture notes in computer science. Springer, Berlin, Heidelberg, pp 445\u2013465","DOI":"10.1007\/978-3-642-41660-6_24"},{"issue":"4","key":"9506_CR17","doi-asserted-by":"crossref","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":"9506_CR18","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 (2010) DNA as a universal substrate for chemical kinetics. Proc Natl Acad Sci 107(12):5393\u20135398","journal-title":"Proc Natl Acad Sci"},{"key":"9506_CR19","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139058520","volume-title":"Enumerative combinatorics. Cambridge studies in advanced mathematics","author":"RP Stanley","year":"2011","unstructured":"Stanley RP (2011) Enumerative combinatorics. Cambridge studies in advanced mathematics, vol 1, 2nd edn. Cambridge University Press, Cambridge","edition":"2"},{"issue":"1","key":"9506_CR20","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1137\/0214019","volume":"14","author":"DE Willard","year":"1985","unstructured":"Willard DE (1985) New data structures for orthogonal range queries. SIAM J Comput 14(1):232\u2013253","journal-title":"SIAM J Comput"},{"issue":"3","key":"9506_CR21","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0020-0190(81)90117-4","volume":"13","author":"H Yamasaki","year":"1981","unstructured":"Yamasaki H (1981) On weak persistency of Petri nets. Inf Process Lett 13(3):94\u201397","journal-title":"Inf Process Lett"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9506-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11047-015-9506-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-015-9506-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T23:50:19Z","timestamp":1559346619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11047-015-9506-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,30]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9506"],"URL":"https:\/\/doi.org\/10.1007\/s11047-015-9506-5","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,30]]}}}