By Topic

An Efficient Approach for Abstraction-Refinement Verification of Hybrid Systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Baoluo Liu ; College of Automation Science and Engineering, South China University of Technology, Guangzhou, China 510640. Email: ieliubl@163.com ; Hailong Pei ; Shengxiang Zhang ; Jiangqiang Li

The core of the abstraction-refinement verification is the analysis of the counterexample and refinement of the abstract model, which are the most expensive parts of the verification procedure. In this paper, we present a method that aims at reducing the complexity as much as possible. Our method combines the qualitative analysis with the reachability analysis. Qualitative analysis checks the feasibility of pair-wise transitions without the explicit numerical reachability computation. While reachability analysis employs bidirectional analysis strategy to minimize the region to be refined. Experiment shows that the integration of these strategies and techniques make the verification more efficient.

Published in:

2007 IEEE International Conference on Control and Automation

Date of Conference:

May 30 2007-June 1 2007