Inspired by Anderson et al. [J. R. Soc. Interface, 2014] we study the long-term behavior of discrete chemical reaction networks (CRNs). In particular, using techniques from both Petri net theory and CRN theory, we provide a powerful sufficient condition for a structurallybounded CRN to have the property that none of the non-terminal reactions can fire for all its recurrent configurations. We compare this result and its proof with a related result of Anderson et al. and show its consequences for the case of CRNs with deficiency one.
CITATION STYLE
Brijder, R. (2015). Dominance and T-invariants for petri nets and chemical reaction networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9211, pp. 1–15). Springer Verlag. https://doi.org/10.1007/978-3-319-21999-8_1
Mendeley helps you to discover research relevant for your work.