Skip to Main content Skip to Navigation

Symbolic controller synthesis for timed systems: robustness and optimality

Abstract : The field of reactive synthesis studies ways to obtain, starting from a specification, a system that is correct by construction. A classical approach models this setting as a zero-sum game played by two players on a transition system, and asks whether player controller can ensure an objective against any competing player environment. We focus on real-time specifications, modelled as timed automata with reachability or Büchi acceptance conditions, and present symbolic ways to synthesise strategies for the controller. We consider two problems, either restricting controller to robust strategies or aiming for optimal strategies in a weighted game setting.
Complete list of metadata

Cited literature [95 references]  Display  Hide  Download
Contributor : Damien Busatto-Gaston Connect in order to contact the contributor
Submitted on : Monday, January 13, 2020 - 2:07:28 PM
Last modification on : Thursday, July 14, 2022 - 4:11:13 AM
Long-term archiving on: : Tuesday, April 14, 2020 - 3:57:33 PM


Files produced by the author(s)


  • HAL Id : tel-02436831, version 1



Damien Busatto-Gaston. Symbolic controller synthesis for timed systems: robustness and optimality. Computer Science and Game Theory [cs.GT]. Aix Marseille Université, 2019. English. ⟨tel-02436831⟩



Record views


Files downloads