Departmental Papers (CIS)

Document Type

Conference Paper

Date of this Version

April 2003

Publication Title

Lecture Notes in Computer Science: Hybrid Systems: Computation and Control

Volume

2623

First Page

4

Last Page

19

DOI

10.1007/3-540-36580-X_4

Comments

From the 6th International Workshop, HSCC 2003 Prague, Czech Republic, April 3–5, 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. To compute the transitions out of an abstract state, the tool needs to compute the set of discrete and continuous successors, and find out all the abstract states that this set intersects with. The complexity of this computation grows exponentially with the number of abstraction predicates. In this paper we present various optimizations that are aimed at speeding up the search in the abstract state-space, and demonstrate their benefits via case studies. We also discuss the completeness of the predicate abstraction technique for proving safety of hybrid systems.

Permission Statement

The original publication is available at www.springerlink.com

Share

COinS
 

Date Posted: 13 December 2005