Robust Analysis of Timed Automata via Channel Machines

Patricia Bouyer (1) , Nicolas Markey (1) , Pierre-Alain Reynier (2)

1 LSV - Laboratoire Spécification et Vérification [Cachan]
2 LIF - Laboratoire d'informatique Fondamentale de Marseille - UMR 6166

Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Several works have thus focused on a modified semantics of timed automata which ensures implementability, and robust model-checking algorithms for safety, and later LTL properties have been designed. Recently, a~new approach has been proposed, which reduces (standard) model-checking of timed automata to other verification problems on channel machines. Thanks to a new encoding of the modified semantics as a network of timed systems, we propose an original combination of both approaches, and prove that robust model-checking for coFlat-MTL, a large fragment of~MTL, is EXPSPACE-Complete.

Domaines: Logique en informatique [cs.LO]

Patricia Bouyer, Nicolas Markey, Pierre-Alain Reynier. Robust Analysis of Timed Automata via Channel Machines. Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), 2008, Budapest, Hungary. pp.157-171, ⟨10.1007/978-3-540-78499-9_12⟩. ⟨hal-01194593⟩