Dominance and Deficiency for Petri Nets and Chemical Reaction Networks

2015/03/12 by Robert Brijder, Brijder, Robert
Biochemistry, Genetics and Molecular Biology · Computer Science · #DNA and Biological Computing #Distributed #FOS: Computer and information sciences #Gene Regulatory Network Analysis #Parallel #Petri Nets in System Modeling #and Cluster Computing (cs.DC)

paper · pdf · doi:10.48550/arxiv.1503.04005

openalex publication_date 2015/03/12 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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 structurally-bounded 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.

Related

• A Petri Net approach to the study of persistence in chemical reaction networks
• The computational power of discrete chemical reaction networks with bounded executions
• Inheritance of oscillation in chemical reaction networks
• Splitting reactions preserves nondegenerate behaviours in chemical reaction networks
• Minimal Output Unstable Configurations in Chemical Reaction Networks and\n Deciders