Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces

We propose an improved symbolic algorithm for the verification of linear hybrid automata with large discrete state spaces (where an explicit representation of discrete states is difficult). Here both the discrete part and the continuous part of the hybrid state space are represented by one symbolic representation called LinAIGs. LinAIGs represent (possibly non-convex) polyhedra extended by Boolean variables. Key components of our method for state space traversal are redundancy elimination and constraint minimization: redundancy elimination eliminates so-called redundant linear constraints from LinAIG representations by a suitable exploitation of the capabilities of SMT (Satisfiability Modulo Theories) solvers. Constraint minimization optimizes polyhedra by exploiting the fact that states already reached in previous steps can be interpreted as “don’t cares” in the current step. Experimental results (including comparisons to the state-of-the-art model checkers PHAVer and RED) demonstrate the advantages of our approach.

► We verify linear hybrid automata using fully symbolic methods. ► Our main focus lies on hybrid automata with large discrete state spaces. ► LinAIGs represent both the discrete and the continuous part of the state space. ► LinAIGs represent (possibly non-convex) polyhedra extended by Boolean variables. ► Redundancy elimination and constraint minimization optimize our state sets.