Departmental Papers (CIS)

Document Type

Conference Paper

Subject Area

CPS Model-Based Design, CPS Formal Methods

Date of this Version

March 2002

Publication Title

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

Volume

2289

First Page

35

Last Page

48

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 discrete programs. This paper presents algorithms and tools for reachability analysis of hybrid systems by combining the notion of predicate abstraction with recent techniques for approximating the set of reachable states of linear systems using polyhedra. Given a hybrid system and a set of user-defined boolean predicates, we consider the finite discrete quotient whose states correspond to all possible truth assignments to the input predicates. The tool performs an on-the-fly exploration of the abstract system. We demonstrate the feasibility of the proposed technique by analyzing a parametric timing-based mutual exclusion protocol and safety of a simple controller for vehicle coordination.

Permission Statement

The original publication is available at www.springerlink.com

Share

COinS
 

Date Posted: 21 December 2005