{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T07:15:56Z","timestamp":1770534956764,"version":"3.49.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032156402","type":"print"},{"value":"9783032156419","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-15641-9_25","type":"book-chapter","created":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T12:21:53Z","timestamp":1770034913000},"page":"378-393","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Polynomial Simulations of\u00a0CRN Models with\u00a0Trimolecular Void Step-Cycle CRNs"],"prefix":"10.1007","author":[{"given":"Austin","family":"Luchsinger","sequence":"first","affiliation":[]},{"given":"Aiden","family":"Massie","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[]},{"given":"Evan","family":"Tomai","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,31]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Agerwala, T.: Complete model for representing the coordination of asynchronous processes. Technical report, Johns Hopkins Univ., Baltimore, Md. (USA) (1974)","DOI":"10.2172\/4242290"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Alaniz, R.M., et al.: Reachability in restricted chemical reaction networks (2022). arXiv:2211.12603","DOI":"10.2139\/ssrn.4665761"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, R., et al.: Computing threshold circuits with void reactions in step chemical reaction networks. In: 10th Conference on Machines, Computations and Universality, MCU\u201924 (2024)","DOI":"10.1007\/978-3-031-81202-6_4"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Anderson, R., et al.: Computing threshold circuits with bimolecular void reactions in step chemical reaction networks. In: International Conference on Unconventional Computation and Natural Computation, UCNC\u201924, pp. 253\u2013268. Springer (2024)","DOI":"10.1007\/978-3-031-63742-1_18"},{"key":"25_CR5","doi-asserted-by":"publisher","unstructured":"Aris, R.: Prolegomena to the rational analysis of systems of chemical reactions. Arch. Ration. Mech. Anal. 19(2), 81\u201399 (1965). https:\/\/doi.org\/10.1007\/BF00282276","DOI":"10.1007\/BF00282276"},{"key":"25_CR6","doi-asserted-by":"publisher","unstructured":"Aris, R.: Prolegomena to the rational analysis of systems of chemical reactions ii. some addenda. Arch. Rational Mech. Anal. 27(5), 356\u2013364 (1968). https:\/\/doi.org\/10.1007\/BF00251438","DOI":"10.1007\/BF00251438"},{"key":"25_CR7","unstructured":"Bajaj, D., et al.: Polynomial equivalence of extended chemical reaction models. Under Submission (2025)"},{"key":"25_CR8","doi-asserted-by":"publisher","unstructured":"Berthomieu, B., Zaitsev, D.A.: Sleptsov nets are turing-complete. Theor. Comput. Sci. 986, 114346 (2024). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S030439752300659X, https:\/\/doi.org\/10.1016\/j.tcs.2023.114346","DOI":"10.1016\/j.tcs.2023.114346"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Calabrese, K., Doty, D.: Rate-independent continuous inhibitory chemical reaction networks are turing-universal. In: International Conference on Unconventional Computation and Natural Computation, pp. 104\u2013118. Springer (2024)","DOI":"10.1007\/978-3-031-63742-1_8"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/s11047-013-9393-6","volume":"13","author":"H-L Chen","year":"2014","unstructured":"Chen, H.-L., Doty, D., Soloveichik, D.: Deterministic function computation with chemical reaction networks. Nat. Comput. 13, 517\u2013534 (2014)","journal-title":"Nat. Comput."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Cook, M., Soloveichik, D., Winfree, E., Bruck, J.: Programmability of chemical reaction networks. In: Algorithmic Bioprocesses, pp. 543\u2013584. Springer (2009)","DOI":"10.1007\/978-3-540-88869-7_27"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Czerwi\u0144ski, W., Orlikowski, \u0141.: Reachability in vector addition systems is ackermann-complete. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 1229\u20131240. IEEE(2022)","DOI":"10.1109\/FOCS52979.2021.00120"},{"key":"25_CR13","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for petri nets\u2013a survey. arXiv preprint: arXiv:2411.01592 (2024)"},{"key":"25_CR14","unstructured":"Bin, F., et al.: Brief announcement: reachability in deletion-only chemical reaction networks. In Proc. of the Symposium on Algorithmic Foundations of Dynamic Networks, SAND (2025)"},{"key":"25_CR15","unstructured":"Hack, M.H.T.: Decidability questions for Petri Nets. PhD thesis, Massachusetts Institute of Technology (1976)"},{"key":"25_CR16","volume-title":"Petri net language","author":"MHT Hack","year":"1976","unstructured":"Hack, M.H.T.: Petri net language. Technical report, Massachusetts Institute of Technology (1976)"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata: a mathematical model for parallel computation. In: 8th Annual Symposium on Switching and Automata Theory (SWAT 1967), pp. 55\u201361. IEEE (1967)","DOI":"10.1109\/FOCS.1967.27"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Leroux, J.: The reachability problem for Petri nets is not primitive recursive. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 1241\u20131252. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00121"},{"key":"25_CR19","unstructured":"Peterson, J.L.: Petri net theory and the modeling of systems (1981)"},{"key":"25_CR20","unstructured":"Petri, C.A.: Communication with automata (1966)"},{"issue":"6","key":"25_CR21","doi-asserted-by":"publisher","first-page":"e21414","DOI":"10.1371\/journal.pone.0021414","volume":"6","author":"P Senum","year":"2011","unstructured":"Senum, P., Riedel, M.: Rate-independent constructs for chemical computation. PLoS ONE 6(6), e21414 (2011)","journal-title":"PLoS ONE"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Shea, A., Fett, B., Riedel, M.D., Parhi, K.: Writing and compiling code into biochemistry. In: Biocomputing 2010, pp. 456\u2013464. World Scientific (2010)","DOI":"10.1142\/9789814295291_0047"},{"key":"25_CR23","unstructured":"Thomas, P.B.: Petri net: a modeling tool for the coordination of asynchronous processes. Technical report, Tennessee Univ., Knoxville (USA); Oak Ridge Gaseous Diffusion Plant, Tenn.(USA) (1976)"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15641-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T12:21:59Z","timestamp":1770034919000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15641-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032156402","9783032156419"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15641-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"31 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/webusers.i3s.univ-cotedazur.fr\/UCNC2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}