Synthesizing switching controllers for hybrid systems by generating invariants

  • Authors:

  • Hengjun Zhao;Naijun Zhan;Deepak Kapur

  • Affiliations:

  • State Key Lab. of Comput. Sci., Institute of Software, CAS, Beijing, China,University of Chinese Academy of Sciences, Beijing, China;State Key Lab. of Comput. Sci., Institute of Software, CAS, Beijing, China;Dept. of Comput. Sci., University of New Mexico, Albuquerque, NM

  • Venue:
  • Theories of Programming and Formal Methods
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

We extend a template-based approach for synthesizing switching controllers for semi-algebraic hybrid systems, in which all expressions are polynomials. This is achieved by combining a QE (quantifier elimination)-based method for generating invariants with a qualitative approach for predefining templates. Our synthesis method is relatively complete with regard to a given family of predefined templates. Using qualitative analysis, we discuss heuristics to reduce the numbers of parameters appearing in the templates. To avoid too much human interaction in choosing templates as well as the high computational complexity caused by QE, we further investigate applications of the SOS (sum-of-squares) relaxation approach and the template polyhedra approach in invariant generation, which are both supported by modern numerical solvers.