Faster Than Uppaal?

  • Authors:
  • Sebastian Kupferschmid;Martin Wehrle;Bernhard Nebel;Andreas Podelski

  • Affiliations:
  • Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Freiburg, Germany;Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Freiburg, Germany;Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Freiburg, Germany;Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Freiburg, Germany

  • Venue:
  • CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

It is probably very hard to develop a new model checker that is faster than Uppaalfor verifying (correct)timed automata. In fact, our tool Mctadoes not even try to compete with Uppaalin this (i.e., Uppaal's) arena. Instead, Mctais geared towards analyzing incorrectspecifications of timed automata. It returns (shorter) error traces faster.