Abstract
In this paper the reachability problem of discrete state Chemical Reaction Networks (d-CRNs) is studied. We consider sub-classes of sub-and superconservative d-CRN network structures and prove that the reachability relation can be decided in polynomial
time. We make use of the result that in the studied d-CRN sub-classes, the reachability relation is equivalent to the existence of a non-negative integer solution of the d-CRN state equation. The equivalence implies the reformulation of
the reachability problem as integer linear programming decision problem. We show that in the studied classes of d-CRN structures, the state equation has a totally unimodular coefficient matrix. As the reachability relation is equivalent
to the non-negative integer solution of the state equation, the resulting integer programming decision program can be relaxed to a simple linear program having polynomial time complexity. Hence, in the studied sub-classes of sub and superconservative
reaction network structures, the reachability relation can be decided in polynomial time and the number of continuous decision variables is equal to the number of reactions of the d-CRN.
