Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus
Safety verification of hybrid systems is a key technique in developing embedded systems that have a strong coupling with the physical environment. We propose an automated logical analytic method for verifying a class of hybrid automata. The problems are more general than those solved by the existing model checkers: our method can verify models with symbolic parameters and nonlinear equations as well. First, we encode the execution trace of a hybrid automaton as an imperative program. Its safety property is then translated into proof obligations by strongest postcondition calculus. Finally, these logic formulas are discharged by state-of-the-art arithmetic solvers (e.g., Mathematica). Our proposed algorithm efficiently performs inductive reasoning by unrolling the execution for some steps and generating loop invariants from verification failures. Our experimental results along with examples taken from the literature show that the proposed approach is feasible.
Unable to display preview. Download preview PDF.
- 1.Ábrahám-Mumm, E., Steffen, M., Hannemann, U.: Verification of hybrid systems: Formalization and proof rules in PVS. In: ICECCS, pp. 48–57 (2001)Google Scholar
- 13.Hoare, C.A.R.: An axiomatic basis for computer programming. Communications of the ACM 12(10), 576–580, 583 (1969)Google Scholar
- 16.Platzer, A.: Logical Analysis of Hybrid Systems. Springer (2010)Google Scholar
- 17.Platzer, A.: Guide for KeYmaera hybrid systems verification tool (2012), http://symbolaris.com/info/KeYmaera-guide.html (accessed January 1, 2013)