Feedback Refinement Relations for the Synthesis of Symbolic Controllers

Gunther Reissig, Alexander Weber, Matthias Rungger.
Feedback Refinement Relations for the Synthesis of Symbolic Controllers.
IEEE Trans. Automat. Control, vol. 62, no. 4, April 2017, pp. 1781-1796.
2019 George S. Axelby Outstanding Paper Award.

Full text. (Definitive publication; restricted access.)
Full text. (Free access.)

Abstract:
We present an abstraction and refinement methodology for the automated controller synthesis to enforce general predefined specifications. The designed controllers require quantized (or symbolic) state information only and can be interfaced with the system via a static quantizer. Both features are particularly important with regard to any practical implementation of the designed controllers and, as we prove, are characterized by the existence of a feedback refinement relation between plant and abstraction. Feedback refinement relations are a novel concept introduced in this paper. Our work builds on a general notion of system with set-valued dynamics and possibly non-deterministic quantizers to permit the synthesis of controllers that robustly, and provably, enforce the specification in the presence of various types of uncertainties and disturbances. We identify a class of abstractions that is canonical in a well-defined sense, and provide a method to efficiently compute canonical abstractions. We demonstrate the practicality of our approach on two examples.

BibTeX entry:

@article{ReissigWeberRungger17,
  AUTHOR = {Reissig, Gunther and Alexander Weber and Matthias Rungger},
  TITLE = {Feedback Refinement Relations for the Synthesis of Symbolic Controllers},
  year = 2017,
  journal = {IEEE Trans. Automat. Control},
  volume = 62,
  number = 4,
  pages = {1781-1796},
  month = apr,
  doi ={10.1109/TAC.2016.2593947},
  eprint = {1503.03715}
}

Impressum und Haftungsausschluß