Untameable Timed Automata ! ( Extended Abstract )


Timed automata are a widely studied model for real-time systems. Since 8 years, several tools implement this model and are successfully used to verify real-life examples. In spite of this well-established framework, we prove that the forward analysis algorithm implemented in these tools is not correct! However, we also prove that it is correct for a… (More)

3 Figures and Tables


  • Presentations referencing similar topics