Model checking of hybrid systems: from reachability towards stability

  • Authors:
  • Andreas Podelski;Silke Wagner

  • Affiliations:
  • Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany

  • Venue:
  • HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
  • Year:
  • 2006

Quantified Score

Hi-index 0.02

Visualization

Abstract

We call a hybrid system stable if every trajectory inevitably ends up in a given region. Our notion of stability deviates from classical definitions in control theory. In this paper, we present a model checking algorithm for stability in the new sense. The idea of the algorithm is to reduce the stability proof for the whole system to a set of (smaller) proofs for several one-mode systems.