Theoretical Computer Science
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
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
Scheduling with timed automata
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Robust safety of timed automata
Formal Methods in System Design
Real-Time Systems: Design Principles for Distributed Embedded Applications
Real-Time Systems: Design Principles for Distributed Embedded Applications
The embedded systems design challenge
FM'06 Proceedings of the 14th international conference on Formal Methods
Shrinktech: a tool for the robustness analysis of timed automata
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Robust controller synthesis in timed automata
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Precise robustness analysis of time petri nets with inhibitor arcs
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Robust weighted timed automata and games
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Automata-theoretic decision of timed games
Theoretical Computer Science
Information and Computation
| Hi-index | 0.00 |
Reachability checking is one of the most basic problems in verification. By solving this problem, one synthesizes a strategy that dictates the actions to be performed for ensuring that the target location is reached. In this work, we are interested in synthesizing "robust" strategies for ensuring reachability of a location in a timed automaton; with "robust", we mean that it must still ensure reachability even when the delays are perturbed by the environment. We model this perturbed semantics as a game between the controller and its environment, and solve the parameterized robust reachability problem: we show that the existence of an upper bound on the perturbations under which there is a strategy reaching a target location is EXPTIME-complete.