By Topic

A faster approximation technique for predicate abstraction 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
$31 $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

2 Author(s)
Hiraishi, K. ; Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan ; Kobayashi, K.

Predicate abstraction is a powerful technique for extracting finite-state models from infinite-state systems, and is applied to verification of safety properties. In this paper, we propose a technique that can be used for accelerating the computation of abstract state spaces for hybrid systems. The technique is based on upper approximation of the state transition relation, and requires a polynomial number of reachability checks and Boolean operations to compute the abstract state space consisting of a (possibly) exponential number of abstract states.

Published in:


Date of Conference:

18-21 Aug. 2009