Reaction systems are discrete dynamical systems that simulate biological processes within living cells through finite sets of
reactants, inhibitors, and products. In this paper, we study the computational complexity of deciding on the existence of
fixed points and attractors in the restricted class of additive reaction systems, in which each reaction involves at most one
reactant and no inhibitors. We prove that all the considered problems, that are known to be hard for other classes of
reaction systems, are polynomially solvable in additive systems. To arrive at these results, we provide several non-trivial
reductions to problems on a polynomially computable graph representation of reaction systems that might prove useful for
addressing other related problems in the future.
