• Citer

Robust analysis of timed automata via channel machines

par Bouyer, Patricia P.;Markey, Nicolas N.;Reynier, Pierre-Alain
Référence Lecture notes in computer science, 4962 LNCS, page (157-171)
Publication Publié, 2008

Article révisé par les pairs

• Accès en ligne
• Détails
• Contenu
• Statistiques

Résumé :

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. © 2008 Springer-Verlag Berlin Heidelberg.