“…Indeed, a ROA provides the set of acceptable (post-fault) conditions of a dynamic system which are known to reach a given target set in a specified time. They can be obtained through the construction of polynomial Lyapunov functions [3], [4], as well as using the notion of occupation measures and Lasserre's hierarchy [5], [6]. As long as the dynamics of the system is polynomial, both formulations yield a moment-sum-of-squares (SOS) optimization program that can be efficiently solved by semi-definite programming (SDP), a particular class of efficient convex optimization tools.…”