Model checking of hybrid systems: From reachability towards stability. (English) Zbl 1178.93077
Hespanha, João (ed.) et al., Hybrid systems: Computation and control. 9th international workshop, HSCC 2006, Santa Barbara, CA, USA, March 29–31, 2006. Proceedings. Berlin: Springer (ISBN 3-540-33170-0/pbk). Lecture Notes in Computer Science 3927, 507-521 (2006).
Summary: 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.
|93C30||Control systems governed by other functional relations|
|68Q60||Specification and verification of programs|