{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T16:04:52Z","timestamp":1771085092677,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:00:00Z","timestamp":1771027200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:00:00Z","timestamp":1771027200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RPG-2022-025"],"award-info":[{"award-number":["RPG-2022-025"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000275","name":"Leverhulme Trust","doi-asserted-by":"publisher","award":["RPG-2022-025"],"award-info":[{"award-number":["RPG-2022-025"]}],"id":[{"id":"10.13039\/501100000275","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2026,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Reaction systems are rooted in processes inspired by the functioning of the living cell. The key idea behind the resulting formal model is that such processes are determined by the interactions of biochemical reactions. Moreover, such interactions are based on the fundamental mechanisms of facilitation and inhibition. Since their inception, reaction systems have developed into an extensively investigated model of computation with unique characteristics and a wide range of potential applications. The semantical model of reaction systems is based on the concept of system states consisting of sets of entities, and state transformations enacted by sets of reactions. Another important behavioural property is the non-permanency of the entities, and so data persistence has to be consciously implemented. Issues like this need to be taken into account in all simulations of reaction systems by means of other existing models and tools, such as Petri nets. In this paper, we provide four different Petri net encodings of basic reaction systems operating without interacting with external environment. We start from a naive encoding that is based on the behaviour of a reaction system\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathscr {R}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    only, transforming the transition system of\n                    <jats:inline-formula>\n                      <jats:tex-math>$$\\mathscr {R}$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    into a Petri net in the form of a marked graph. Such a solution introduces exponentially many places and transitions. In the subsequent encodings, we cope with this exponentiality ending up with a solution that is polynomial in the size of the original reaction system. We then show how this polynomial encoding can be adapted to provide a polynomial encoding for reaction systems operating with contexts provided by context automata. The encoding method proposed in this paper is modular and can provide a basis for compositional construction of reaction systems.\n                  <\/jats:p>","DOI":"10.1007\/s11047-025-10060-7","type":"journal-article","created":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T15:19:44Z","timestamp":1771082384000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Encoding reaction systems in Petri nets"],"prefix":"10.1007","volume":"25","author":[{"given":"Maciej","family":"Koutny","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u0141ukasz","family":"Mikulski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"key":"10060_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.tcs.2015.02.014","volume":"598","author":"S Azimi","year":"2015","unstructured":"Azimi S, Gratie C, Ivanov S, Petre I (2015) Dependency graphs and mass conservation in reaction systems. Theor Comput Sci 598:23\u201339","journal-title":"Theor Comput Sci"},{"issue":"07","key":"10060_CR2","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1142\/S0129054111008842","volume":"22","author":"R Brijder","year":"2011","unstructured":"Brijder R, Ehrenfeucht A, Main M, Rozenberg G (2011) A tour of reaction systems. Int J Found Comput Sci 22(07):1499\u20131517","journal-title":"Int J Found Comput Sci"},{"issue":"2","key":"10060_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s11047-024-09990-5","volume":"23","author":"R Bruni","year":"2024","unstructured":"Bruni R, Gori R, Milazzo P, Siboulet H (2024) Melding boolean networks and reaction systems under synchronous, asynchronous and most permissive semantics. Nat Comput 23(2):235\u2013267","journal-title":"Nat Comput"},{"issue":"5","key":"10060_CR4","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/S0022-0000(71)80013-2","volume":"5","author":"F Commoner","year":"1971","unstructured":"Commoner F, Holt AW, Even S, Pnueli A (1971) Marked directed graphs. J Comput Syst Sci 5(5):511\u2013523","journal-title":"J Comput Syst Sci"},{"key":"10060_CR5","doi-asserted-by":"crossref","unstructured":"Desel J, Reisig W (1996) Place\/transition Petri nets. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri nets I: basic models, advances in Petri nets, the volumes are based on the advanced course on Petri nets, held in Dagstuhl, September 1996. Lecture Notes in Computer Science, vol. 1491, pp. 122\u2013173 Springer","DOI":"10.1007\/3-540-65306-6_15"},{"issue":"1\u20134","key":"10060_CR6","first-page":"263","volume":"75","author":"A Ehrenfeucht","year":"2007","unstructured":"Ehrenfeucht A, Rozenberg G (2007) Reaction systems. Fundam Inform 75(1\u20134):263\u2013280","journal-title":"Fundam Inform"},{"key":"10060_CR7","doi-asserted-by":"crossref","unstructured":"Ehrenfeucht A, Kleijn J, Koutny M, Rozenberg G (2012) Relevance of entities in reaction systems. Languages alive: essays dedicated to J\u00fcrgen Dassow on the occasion of his 65th birthday, 44\u201355","DOI":"10.1007\/978-3-642-31644-9_3"},{"issue":"1\u20134","key":"10060_CR8","first-page":"175","volume":"171","author":"C Ferretti","year":"2020","unstructured":"Ferretti C, Leporati A, Manzoni L, Porreca AE (2020) The many roads to the simulation of reaction systems. Fund Inform 171(1\u20134):175\u2013188","journal-title":"Fund Inform"},{"key":"10060_CR9","unstructured":"Kleijn J, Koutny M, Rozenberg G (2011a) Modelling reaction systems with Petri nets. International Workshop on Biological Processes & Petri Nets. CEUR Workshop Proceedings 724:36\u201352"},{"issue":"2","key":"10060_CR10","first-page":"199","volume":"21","author":"J Kleijn","year":"2011","unstructured":"Kleijn J, Koutny M, Rozenberg G (2011b) Petri nets for biologically motivated computing. Sci Ann Comput Sci 21(2):199\u2013225","journal-title":"Sci Ann Comput Sci"},{"key":"10060_CR11","unstructured":"Kleijn J, Koutny M, Pietkiewicz-Koutny M, Rozenberg G (2012) Petri net synthesis and membrane systems. In: 6th Workshop on Membrane Computing and Biologically Inspired Process Calculi, 7"},{"issue":"6","key":"10060_CR12","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1007\/s10009-021-00615-1","volume":"23","author":"F Kordon","year":"2021","unstructured":"Kordon F, Hillah L, Hulin-Hubard F, Jezequel L, Paviot-Adet E (2021) Study of the efficiency of model checking techniques using results of the MCC from 2015 to 2019. Int J Softw Tools Technol Transf 23(6):931\u2013952","journal-title":"Int J Softw Tools Technol Transf"},{"key":"10060_CR13","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ins.2015.03.048","volume":"313","author":"A M\u0119ski","year":"2015","unstructured":"M\u0119ski A, Penczek W, Rozenberg G (2015) Model checking temporal properties of reaction systems. Inf Sci 313:22\u201342","journal-title":"Inf Sci"},{"key":"10060_CR14","unstructured":"M\u0119ski A, Koutny M, Penczek W (2019) Model checking for temporal-epistemic properties of distributed reaction systems. School of computing technical report series"},{"issue":"2","key":"10060_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s11047-024-09989-y","volume":"23","author":"A M\u0119ski","year":"2024","unstructured":"M\u0119ski A, Koutny M, Mikulski \u0141, Penczek W (2024) Reaction mining for reaction systems. Nat Comput 23(2):323\u2013343","journal-title":"Nat Comput"},{"key":"10060_CR16","doi-asserted-by":"crossref","unstructured":"Poliakov I, Khomenko V, Yakovlev A (2009) Workcraft - A framework for interpreted graph models. In: Franceschinis, G., Wolf, K. (eds.) PETRI NETS 2009. Lecture Notes in Computer Science, 5606:333\u2013342. Springer","DOI":"10.1007\/978-3-642-02424-5_21"},{"key":"10060_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33278-4","volume-title":"Understanding petri nets - modeling techniques, analysis methods. Case Studies","author":"W Reisig","year":"2013","unstructured":"Reisig W (2013) Understanding petri nets - modeling techniques, analysis methods. Case Studies. Springer, New York"},{"key":"10060_CR18","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s00165-010-0161-4","volume":"23","author":"WM Van Der Aalst","year":"2011","unstructured":"Van Der Aalst WM, Van Hee KM, Ter Hofstede AH, Sidorova N, Verbeek H, Voorhoeve M, Wynn MT (2011) Soundness of workflow nets: classification, decidability, and analysis. Form Asp Comput 23:333\u2013363","journal-title":"Form Asp Comput"},{"key":"10060_CR19","unstructured":"Van Der Aalst WM (1996) Structural characterizations of sound workflow nets. Technical report, Technische Universiteit Eindhoven"},{"key":"10060_CR20","doi-asserted-by":"crossref","unstructured":"Van Hee K, Serebrenik A, Sidorova N, Voorhoeve M (2005) Soundness of resource-constrained workflow nets. In: Applications and Theory of Petri Nets 2005: 26th International Conference, ICATPN 2005, Miami, USA, June 20-25, 2005. Proceedings 26, pp 250\u2013267. Springer","DOI":"10.1007\/11494744_15"},{"key":"10060_CR21","unstructured":"Van Der Aalst WM, Van\u00a0Dongen BF, G\u00fcnther CW, Rozinat A, Verbeek H, Weijters A (2009) Prom: The process mining toolkit. In: Proceedings of the BPM 2009 Demonstration Track (BPMDemos 2009, Ulm, Germany, September 8, 2009), pp 1\u20134 CEUR-WS. org"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-025-10060-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-025-10060-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-025-10060-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T15:19:46Z","timestamp":1771082386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-025-10060-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,14]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10060"],"URL":"https:\/\/doi.org\/10.1007\/s11047-025-10060-7","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,14]]},"assertion":[{"value":"16 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"8"}}