Construction of reachable sets for irreversible positive linear discrete dynamical systems

We present an improved algorithm for the calculation of reachable sets of positive linear discrete-time systems with polyhedral initial set and polyhedral control sets (polyhedral cones, polytopes, or polyhedra). In particular, the algorithm caters for the case where the transition matrix is singular and the dynamics are irreversible. We demonstrate the algorithm with a numerical example.