Robust Reachability in Timed Automata: A Game-Based Approach
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.
KeywordsWinning Strategy Time Automaton Winning State Clock Constraint Greedy Policy
Unable to display preview. Download preview PDF.
- 3.Asarin, E., Maler, O., Pnueli, A., Sifakis, J.: Controller synthesis for timed automata. In: SSSC 1998, pp. 469–474. Elsevier (1998)Google Scholar
- 5.Bouyer, P., Markey, N., Sankur, O.: Robust reachability in timed automata: A game-based approach. Technical Report LSV-12-07, Lab. Specification & Verification, ENS Cachan, France (May 2012)Google Scholar
- 6.Chatterjee, K., Henzinger, T.A., Prabhu, V.S.: Timed parity games: Complexity and robustness. LMCS 7(4) (2010)Google Scholar
- 12.Kopetz, H.: Real-Time Systems: Design Principles for Distributed Embedded Applications. Springer (2011)Google Scholar
- 14.Markey, N.: Robustness in real-time systems. In: SIES 2011, pp. 28–34. IEEE Comp. Soc. Press (2011)Google Scholar
- 16.Reineke, J., Wachter, B., Thesing, S., Wilhelm, R., Polian, I., Eisinger, J., Becker, B.: A definition and classification of timing anomalies. In: WCET 2006 (2006)Google Scholar
- 17.Sankur, O., Bouyer, P., Markey, N.: Shrinking timed automata. In: FSTTCS 2011. LIPIcs, vol. 13, pp. 375–386. LZI (2011)Google Scholar