Robust Model-Checking of Timed Automata via Pumping in Channel Machines
Timed automata are governed by a mathematical semantics which assumes perfectly continuous and precise clocks. This requirement is not satisfied by digital hardware on which the models are implemented. In fact, it was shown that the presence of imprecisions, however small they may be, may yield extra behaviours. Therefore correctness proven on the formal model does not imply correctness of the real system.
The problem of robust model-checking was then defined to circumvent this inconsistency. It consists in computing a bound on the imprecision under which the system will be correct.
In this work, we show that robust model-checking against ω-regular properties for timed automata can be reduced to standard model-checking of timed automata, by computing an adequate bound on the imprecision. This yields a new algorithm for robust model-checking of ω-regular properties, which is both optimal and valid for general timed automata.
KeywordsProgress Cycle Linear Temporal Logic Safety Property Time Automaton Delay Transition
Unable to display preview. Download preview PDF.
- 3.Bouyer, P., Markey, N., Ouaknine, J., Worrell, J.: The cost of punctuality. In: LICS 2007, Wrocław, Poland, pp. 109–118. IEEE Computer Society Press, Los Alamitos (2007)Google Scholar
- 6.Bouyer, P., Markey, N., Sankur, O.: Robust model-checking of timed automata via pumping in channel machines. Research Report LSV-11-19, Laboratoire Spécification et Vérification, ENS Cachan, France (2011)Google Scholar
- 11.Havelund, K., Skou, A., Larsen, K.G., Lund, K.: Formal modeling and analysis of an audio/video protocol: an industrial case study using uppaal. In: RTSS 1997. IEEE Computer Society, Los Alamitos (1997)Google Scholar