Abstract
Reachability computation is the central problem in the verification of hybrid or continuous systems and has become a major research issue in hybrid systems. Most approaches to solve this problem are based on a combination of numerical integration and geometrical algorithms. However, it is also possible to use hybridization methods to perform this computation. The basic idea consists in splitting the continuous state space into cells and abstracting the continuous dynamics in each cell, by a linear differential inclusion for which the reachable space may be computed with polyhedra (F. One key point is then to find a trade off between the number of cells that are introduced and the accuracy of the over-approximation. The choice of the hyperplanes that define the cells is also important and it is possible to use structural properties of the continuous dynamics to guide this choice.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
