Reachability Analysis of Hybrid Systems via Predicate Abstraction
Files
Penn collection
Degree type
Discipline
Subject
CPS Formal Methods
Funder
Grant number
License
Copyright date
Distributor
Related resources
Author
Contributor
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.
Advisor
Date of presentation
Conference name
Conference dates
Conference location
Date Range for Data Collection (Start Date)
Date Range for Data Collection (End Date)
Digital Object Identifier
Series name and number
Volume number
Issue number
Publisher
Publisher DOI
Comments
Postprint version. Published in Lecture Notes in Computer Science, Volume 2289, Hybrid Systems: Computation and Control, 2002, pages 35-48. Publisher URL: http://www.springerlink.com/link.asp?id=2am0hu8ky05avngn