Departmental Papers (CIS)
Date of this Version
April 2003
Document Type
Conference Paper
Recommended Citation
Rajeev Alur, Thao Dang, and Franjo Invancic, "Counter-Example Guided Predicate Abstraction of Hybrid Systems", Lecture Notes in Computer Science: Tools and Algorithms for the Construction and Analysis of Systems 2619, 208-223. April 2003. http://dx.doi.org/10.1007/3-540-36577-X_15
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.
Subject Area
CPS Model-Based Design, CPS Formal Methods
Publication Source
Lecture Notes in Computer Science: Tools and Algorithms for the Construction and Analysis of Systems
Volume
2619
Start Page
208
Last Page
223
DOI
10.1007/3-540-36577-X_15
Copyright/Permission Statement
The original publication is available at www.springerlink.com
Date Posted: 13 December 2005
Comments
From the 9th International Conference, TACAS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003.