Bernstein coefficients; Polynomial dynamical systems; Reachability; Theoretical Computer Science; Software; Hardware and Architecture

This paper is concerned with the problem of computing the bounded time reachable set of a polynomial discrete-time dynamical system. The problem is well-known for being difficult when nonlinear systems are considered. In this regard, we propose three …