Mcta: heuristics and search for timed systems

Wehrle, Martin and Kupferschmid, Sebastian. (2012) Mcta: heuristics and search for timed systems. In: Formal Modeling and Analysis of Timed Systems : 10th International Conference (FORMATS 2012). Berlin, pp. 252-266.

Full text not available from this repository.

Official URL: http://edoc.unibas.ch/dok/A6043734

Downloads: Statistics Overview


Mcta is a directed model checking tool for concurrent systems of timed automata. This paper reviews Mcta and its new developments from an implementation point of view. The new developments include both heuristics and search techniques that define the state of the art in directed model checking. In particular, Mcta features the powerful class of pattern database heuristics for efficiently finding shortest possible error traces. Furthermore, Mcta offers new search techniques based on multi-queue search algorithms. Our evaluation demonstrates that Mcta is able to significantly outperform previous versions of Mcta as well as related state-of-the-art tools like Uppaal and Uppaal/Dmc.
Faculties and Departments:05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert)
UniBasel Contributors:Wehrle, Martin
Item Type:Conference or Workshop Item, refereed
Conference or workshop item Subtype:Conference Paper
ISBN:978-3-642-33365-1 (E-Book) ; 978-3-642-33364-4 (Print)
Series Name:Lecture Notes in Computer Science
Issue Number:7595
Note:Publication type according to Uni Basel Research Database: Conference paper
Related URLs:
Identification Number:
Last Modified:13 Sep 2013 08:00
Deposited On:13 Sep 2013 07:58

Repository Staff Only: item control page