Reachability Analysis of Hybrid Systems via Predicate Abstraction

  • Rajeev Alur
  • Thao Dang
  • Franjo Ivančić
Conference paper

DOI: 10.1007/3-540-45873-5_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2289)
Cite this paper as:
Alur R., Dang T., Ivančić F. (2002) Reachability Analysis of Hybrid Systems via Predicate Abstraction. In: Tomlin C.J., Greenstreet M.R. (eds) Hybrid Systems: Computation and Control. HSCC 2002. Lecture Notes in Computer Science, vol 2289. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Rajeev Alur
    • 1
  • Thao Dang
    • 1
  • Franjo Ivančić
    • 1
  1. 1.Department of Computer and Information ScienceUniversity of PennsylvaniaUSA

Personalised recommendations