Abstract
This paper presents an overview of the verification of hybrid systems. Verification techniques are usually based on calculation of the reachable state space of a hybrid automaton representing the system under study. Decidability issues related to the verification algorithms require the use of approximation and abstraction techniques. In particular, discrete abstraction of hybrid systems and over-approximation techniques to accelerate the convergence of the reachability-based algorithms are emphasized in this paper. The advantages and the limitations of these techniques are also highlighted.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
