Decidability of Verification of Safety Properties of Spatial Families of Linear Hybrid Automata

Abstract

We consider systems composed of an unbounded number of uniformly designed linear hybrid automata, whose dynamic behavior is determined by their relation to neighboring systems. We present a class of such systems and a class of safety properties whose verification can be reduced to the verification of (small) families of "neighboring" systems of bounded size, and identify situations in which such verification problems are decidable, resp. fixed parameter tractable. We illustrate the approach with an example from coordinated vehicle guidance, and describe an implementation which allows us to perform such verification tasks automatically.

Parametric Systems: Verification and Synthesis

“…We then analyzed the applicability of these ideas to increasingly more complex hybrid automata (parametric linear hybrid automata, parametric hybrid automata, interconnected families of hybrid automata). More details on such problems can be found in [6]. In recent work we analyzed the applicability of these ideas for invariant generation in [23].…”

“…We formally defined and studied a class of interconnected linear hybrid automata in [6] where we proved that locality results allow us to prove "small model properties" for such systems, and to reduce the verification of general interconnected systems in the class to the verification of a finite number of finite such systems.…”