Chapter

Hybrid Systems: Computation and Control

Volume 2289 of the series Lecture Notes in Computer Science pp 35-48

Date:

Reachability Analysis of Hybrid Systems via Predicate Abstraction

  • Rajeev AlurAffiliated withDepartment of Computer and Information Science, University of Pennsylvania
  • , Thao DangAffiliated withDepartment of Computer and Information Science, University of Pennsylvania
  • , Franjo IvančićAffiliated withDepartment of Computer and Information Science, University of Pennsylvania

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Predicate abstraction has emerged to be a powerful technique for extracting finite-state models from infinite-state discrete programs. Th is 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.Giv en a hybrid system and a set of userde fined boolean predicates, we consider the finite discrete quotient whose states correspond to all possible truth assignments to the input predicates. T he 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.