A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Lyapunov abstractions for inevitability of hybrid systems
2012
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control - HSCC '12
A set of states S is said to be inevitable for a hybrid automaton A if every behavior of A ultimately reaches S within bounded time. Inevitability captures various commonly occurring liveness properties. In this paper, we present an algorithm for verifying inevitability of Linear Hybrid Automata (LHA). The algorithm combines (a) Lyapunov function-based relational abstractions for the continuous dynamics with (b) automated construction of well-founded relations for the loops of the hybrid
doi:10.1145/2185632.2185652
dblp:conf/hybrid/DuggiralaM12
fatcat:u62y52byy5f6fnqtpq4yuidlee