Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach

Damien Busatto-Gaston 1 Benjamin Monmege 1 Pierre-Alain Reynier 1 Ocan Sankur 2
1 MOVE - Modélisation et Vérification
LIS - Laboratoire d'Informatique et Systèmes
2 SUMO - SUpervision of large MOdular and distributed systems
Inria Rennes – Bretagne Atlantique , IRISA_D4 - LANGAGE ET GÉNIE LOGICIEL
Abstract : We solve in a purely symbolic way the robust controller synthesis problem in timed automata with Büchi acceptance conditions. The goal of the controller is to play according to an accepting lasso of the automaton, while resisting to timing perturbations chosen by a competing environment. The problem was previously shown to be PSPACE-complete using regions-based techniques, but we provide a first tool solving the problem using zones only, thus more resilient to state-space explosion problems. The key ingredient is the introduction of branching constraint graphs allowing to decide in polynomial time whether a given lasso is robust, and even compute the largest admissible perturbation if it is. We also make an original use of constraint graphs in this context in order to test the inclusion of timed reachability relations, crucial for the termination criterion of our algorithm. Our techniques are illustrated using a case study on the regulation of a train network.
Complete list of metadatas

Cited literature [29 references]  Display  Hide  Download
Contributor : Benjamin Monmege <>
Submitted on : Tuesday, August 6, 2019 - 11:28:46 AM
Last modification on : Thursday, August 8, 2019 - 1:11:26 AM


Files produced by the author(s)


  • HAL Id : hal-02264083, version 1


Damien Busatto-Gaston, Benjamin Monmege, Pierre-Alain Reynier, Ocan Sankur. Robust Controller Synthesis in Timed Büchi Automata: A Symbolic Approach. 31st International Conference on Computer Aided Verification, Jul 2019, New-York, United States. pp.572-590. ⟨hal-02264083⟩



Record views


Files downloads