Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus

Abstract

Abstract. 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.

Refinement and Proof Based Development of Systems Characterized by Continuous Functions

“…While this approach enables automatic verification, it requires elaborate optimization techniques in order to handle the state space explosion as well as symbolic parameters and non-linear equations. To address these problems, logical analysis of hybrid automata brought interesting results [19]. They address classes of automata.…”