Model Checking of Hybrid Systems: From Reachability Towards Stability

  • Andreas Podelski
  • Silke Wagner
Conference paper

DOI: 10.1007/11730637_38

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3927)
Cite this paper as:
Podelski A., Wagner S. (2006) Model Checking of Hybrid Systems: From Reachability Towards Stability. In: Hespanha J.P., Tiwari A. (eds) Hybrid Systems: Computation and Control. HSCC 2006. Lecture Notes in Computer Science, vol 3927. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Andreas Podelski
    • 1
  • Silke Wagner
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations