论文信息 - Faster Than Uppaal?

Faster Than Uppaal?

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

[1] Stefan Edelkamp,et al. Directed explicit-state model checking in the validation of communication protocols , 2004, International Journal on Software Tools for Technology Transfer.

[2] S. Kupferschmid,et al. Adapting an AI Planning Heuristic for Directed Model Checking , 2006, SPIN.

[3] S. Anderson,et al. Secure Synthesis of Code: A Process Improvement Experiment , 1999, World Congress on Formal Methods.

[4] Stefan Edelkamp,et al. Directed explicit model checking with HSF-SPIN , 2001, SPIN '01.

[5] Joseph Sifakis,et al. Tools and Applications II: The IF Toolset , 2004 .

[6] Kim G. Larsen,et al. A Tutorial on Uppaal , 2004, SFM.

[7] Henning Dierks. Comparing model checking and logical reasoning for real-time systems , 2004, Formal Aspects of Computing.

[8] Blai Bonet,et al. Planning as heuristic search , 2001, Artif. Intell..

[9] Andreas Podelski,et al. ACSAR: Software Model Checking with Transfinite Refinement , 2007, SPIN.

[10] Ernst-Rüdiger Olderog,et al. The UniForM Workbench, a Universal Development Environment for Formal Methods , 1999, World Congress on Formal Methods.