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

more »

... n 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. Partly supported by project DOTS (ANR-06-SETIN-003). Partly supported by a Marie Curie fellowship (European Commission). Partly supported by a Lavoisier fellowship (French Ministry of Foreign Affairs). ) for the set of timed words than can be read starting from ( , v).