Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Predicate Abstraction for Reachability Analysis of Hybrid Systems
 

Summary: Predicate Abstraction for Reachability Analysis of
Hybrid Systems
RAJEEV ALUR
University of Pennsylvania
and
THAO DANG
VERIMAG
and
FRANJO IVANCI´C
NEC Laboratories America
Embedded systems are increasingly finding their way into a growing range of physical devices.
These embedded systems often consist of a collection of software threads interacting concurrently
with each other and with a physical, continuous environment. While continuous dynamics have
been well studied in control theory, and discrete and distributed systems have been investigated
in computer science, the combination of the two complexities leads us to the recent research on
hybrid systems. This paper addresses the formal analysis of such hybrid systems.
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

  

Source: Alur, Rajeev - Department of Computer and Information Science, University of Pennsylvania

 

Collections: Computer Technologies and Information Sciences