Theoretical Computer Science
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
A Comparison of Control Problems for Timed and Hybrid Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
Robust safety of timed automata
Formal Methods in System Design
Thin and thick timed regular languages
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Robust reachability in timed automata: a game-based approach
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Frequencies in forgetful timed automata
FORMATS'12 Proceedings of the 10th international conference on Formal Modeling and Analysis of Timed Systems
Information and Computation
| Hi-index | 0.00 |
We consider the fundamental problem of Büchi acceptance in timed automata in a robust setting. The problem is formalised in terms of controller synthesis: timed automata are equipped with a parametrised game-based semantics that models the possible perturbations of the decisions taken by the controller. We characterise timed automata that are robustly controllable for some parameter, with a simple graph theoretic condition, by showing the equivalence with the existence of an aperiodic lasso that satisfies the winning condition (aperiodicity was defined and used earlier in different contexts to characterise convergence phenomena in timed automata). We then show decidability and PSPACE-completeness of our problem.