Improving polygonal hybrid systems reachability analysis through the use of the phase portrait

Abstract

Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant dierential inclusions. The computation of certain objects of the phase portrait of an SPDI, namely the viability, controllability, invariance kernels and semi-separatrix curves have been shown to be eciently decidable. On the other hand, although the reachability problem for SPDIs is known to be decidable, its complexity makes it unfeasible on large systems. We summarise our recent results on the use of the SPDI phase portraits for improving reachability analysis by (i) state-space reduction and (ii) decomposition techniques of the state space, enabling compositional parallelisation of the analysis. Both techniques contribute to increasing the feasability of reachability analysis on large SPDI systems.peer-reviewe