Departmental Papers (CIS)
Document Type
Conference Paper
Date of this Version
April 2003
Abstract
Predicate abstraction has emerged to be a powerful technique for extracting finite-state models from infinite-state systems, and has been recently shown to enhance the effectiveness of the reachability computation techniques for hybrid systems. Given a hybrid system with linear dynamics and a set of linear predicates, the verifier performs an on-the-fly search of the finite discrete quotient whose states correspond to the truth assignments to the input predicates. The success of this approach depends on the choice of the predicates used for abstraction. In this paper, we focus on identifying these predicates automatically by analyzing spurious counter-examples generated by the search in the abstract state-space. We present the basic techniques for discovering new predicates that will rule out closely related spurious counter-examples, optimizations of these techniques, implementation of these in the verification tool, and case studies demonstrating the promise of the approach.
Date Posted: 13 December 2005
Comments
Postprint version. Published in Lecture Notes in Computer Science, Volume 2619, Tools and Algorithms for the Construction and Analysis of Systems, (TACAS 2003), pages 208-223.
Publisher URL: http://springerlink.metapress.com/link.asp?id=50gw0j6dydh09773