Continuous Petri nets for biochemical network analysis
Abstract Yield optimisation of a molecular species in a chemical reaction network is of interest in chemistry and biochemistry, especially in the study of metabolic networks. Chemical reaction networks find a natural computational analogue in Petri nets, with places modeling molecular species and transitions modeling the transformation of educts into products. Although molecules are discrete entities, the yield of a molecule from given sources can be semantically-equivalently abstracted by continuous Petri nets (CPNs). Additionally, CPNs benefit from lower computational complexity, reachability being polynomial. We implement the polynomial-time continuous Petri net coverability procedure of Fraca and Haddad and combine it with binary search to approximate the supremal yield of a designated product to a prescribed precision. As a contrasting formal strategy, we also encode the same objective in a mixed-integer linear framework, which trades provable complexity for broader expressiveness. We compare these two formulations on both synthetic examples and chemically inspired networks, alongside a case-study of the non-oxidative part of the pentose-phosphate pathway, highlighting chemically relevant results.
Authors
- Adeline Jordon (ORCID: https://orcid.org/0000-0003-0796-6775)
- Juri Kolčák (ORCID: https://orcid.org/0000-0002-9407-9682)
- Daniel Merkle (ORCID: https://orcid.org/0000-0001-7792-375X)
Institutions
- University of Southern Denmark (DK)
- Bielefeld University (DE)
Publication Details
- Journal
- Natural Computing
- Published
- 2026-10-31
- DOI
- https://doi.org/10.1007/s11047-026-10092-7
- Primary Topic
- Petri Nets in System Modeling
- Type
- article
- Field-Weighted Citation Impact
- 0.00