Abstract

As the key step in verifying hybrid systems, the computation of reachable sets largely determines the complexity and thus the applicability of a verification approach. Most existing methods compute the reachable set without considering the specification to be verified. This paper presents an approach that identifies for abstractions of the hybrid model those behaviors that potentially violate the specification. A tailor-made sequence of validation procedures then checks the existence of these behaviors for the original model. In many cases, the proposed iterative algorithm that combines model abstraction, behavior validation, and model refinement to verify the specification explores a considerably smaller part of the reachable set than standard techniques. The paper describes an implementation of the procedure and illustrates the approach for an automotive cruise control example.

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

Disclaimer: 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.