Safety verification of non-linear hybrid systems is quasi-semidecidable

  • Authors:
  • Stefan Ratschan

  • Affiliations:
  • Institute of Computer Science, Academy of Science of the Czech Republic

  • Venue:
  • TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Safety verification of hybrid systems is undecidable, except for very special cases In this paper, we circumvent undecidability by providing an algorithm that can verify safety and provably terminates for all robust and safe problem instances It need not necessarily terminate for problem instances that are unsafe or non-robust A problem instance x is robust iff the given property holds not only for x itself, but also when x is perturbed a little bit Since, in practice, well-designed hybrid systems are usually robust, this implies that the algorithm terminates for the cases occurring in practice In contrast to earlier work, our result holds for a very general class of hybrid systems, and it uses a continuous time model.