Implementation Choice of representation for the set P (P  C): C can be the set of polytopes, ellipsoids, level sets… Let us assume that the initial set I  C, then define two functions Implement the previous algorithm with the functions : - Over-approximation of the reachable set Reach [0,r] (I) - Under some assumptions, we can prove convergence as r  0.