Reachability Analysis of Low-Order Discrete State Reaction Networks Obeying Conservation Laws

الملخص EN

In this paper we study the reachability problem of sub- and superconservative discrete state chemical reaction networks (d-CRNs).

It is known that a subconservative network has bounded reachable state space, while that of a superconservative one is unbounded.

The reachability problem of superconservative reaction networks is traced back to the reachability of subconservative ones.

We consider network structures composed of reactions having at most one input and one output species beyond the possible catalyzers.

We give a proof that, assuming all the reactions are charged in the initial and target states, the reachability problems of sub- and superconservative reaction networks are equivalent to the existence of nonnegative integer solution of the corresponding d-CRN state equations.

Using this result, the reachability problem is reformulated as an Integer Linear Programming (ILP) feasibility problem.

Therefore, the number of feasible trajectories satisfying the reachability relation can be counted in polynomial time in the number of species and in the distance of initial and target states, assuming fixed number of reactions in the system.