Reachability Analysis of Hybrid Systems via Predicate Abstraction (2002)
| Venue: | Hybrid Systems: Computation and Control, Fifth International Workshop, LNCS 2289 |
| Citations: | 41 - 7 self |
BibTeX
@INPROCEEDINGS{Alur02reachabilityanalysis,
author = {Rajeev Alur and Thao Dang and Franjo Ivancic},
title = {Reachability Analysis of Hybrid Systems via Predicate Abstraction},
booktitle = {Hybrid Systems: Computation and Control, Fifth International Workshop, LNCS 2289},
year = {2002},
pages = {35--48},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 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 by using weakest preconditions to compute abstract transitions corresponding to the discrete switches and conservative polyhedral approximations to compute abstract transitions corresponding to continuous flows. Compared to tools such as Checkmate and d/dt, this approach requires significantly less computational resources as the emphasis is shifted from computing the reachable set to searching in the abstract quotient. 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.
