Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws

DOI10.46793/MATCH.89-1.175SzbMath1505.92318OpenAlexW4293404554MaRDI QIDQ5050755

Gábor Szederkényi, Gergely Szlobodnyik

Publication date: 17 November 2022

Published in: MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.46793/match.89-1.175s

Mathematics Subject Classification ID

Integer programming (90C10) Classical flows, reactions, etc. in chemistry (92E20) Attainable sets, reachability (93B03) Systems biology, networks (92C42)

Related Items (1)

Polynomial time coverability analysis in discrete state chemical reaction network subclasses

Uses Software

• Gurobi
• LattE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tutorial on chemical reaction network dynamics
• Introduction to modeling biological cellular control systems
• A computational approach to extinction events in chemical reaction networks with discrete state spaces
• Counting integer points in parametric polytopes using Barvinok's rational functions
• A structure to decide reachability in Petri nets
• Geometric algorithms and combinatorial optimization
• Integer programming, Barvinok's counting algorithm and Gomory relaxations.
• Foundations of chemical reaction network theory
• Computing all possible graph structures describing linearly conjugate realizations of kinetic systems
• Conditions for extinction events in chemical reaction networks with discrete state spaces
• A computational approach to the structural analysis of uncertain kinetic systems
• Reachability analysis of low-order discrete state reaction networks obeying conservation laws
• Effective lattice point counting in rational convex polytopes
• Complexity Hierarchies beyond Elementary
• Integer Programming with a Fixed Number of Variables
• Weak Dynamical Nonemptiability and Persistence of Chemical Kinetics Systems
• Monomolecular reaction networks: Flux-influenced sets and balloons
• Conservation Laws in Biochemical Reaction Networks
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Stochastic Analysis of Biochemical Systems
• A Primal Barvinok Algorithm Based on Irrational Decompositions

This page was built for publication: Polynomial Time Reachability Analysis in Discrete State Chemical Reaction Networks Obeying Conservation Laws