Munta: A Verified Model Checker for Timed Automata

Munta is a mechanically verified model checker for timed automata, a popular formalism for modeling real-time systems. Our goal is two-fold: first, we want to provide a reference implementation that is fast enough to test other model checkers against it on reasonably sized benchmarks; second, the tool should be practical enough so that it can easily be used for experimentation. Munta can be compiled to Standard ML or OCaml and additionally features a web-based GUI. Its modeling language has a simple semantics but provides the most commonly used timed automata modeling features.

[1]  Peter Lammich,et al.  Verified Model Checking of Timed Automata , 2018, TACAS.

[2]  Tobias Nipkow,et al.  A Verified Compiler from Isabelle/HOL to CakeML , 2018, ESOP.

[3]  Marta Z. Kwiatkowska,et al.  PRISM 4.0: Verification of Probabilistic Real-Time Systems , 2011, CAV.

[4]  Kim G. Larsen,et al.  Lower and upper bounds in zone-based abstractions of timed automata , 2004, International Journal on Software Tools for Technology Transfer.

[5]  Farn Wang,et al.  Efficient verification of timed automata with BDD-like data structures , 2004, International Journal on Software Tools for Technology Transfer.

[6]  Wang Yi,et al.  Timed Automata: Semantics, Algorithms and Tools , 2003, Lectures on Concurrency and Petri Nets.

[7]  Tobias Nipkow,et al.  Code Generation via Higher-Order Rewrite Systems , 2010, FLOPS.

[8]  Ramana Kumar,et al.  A new verified compiler backend for CakeML , 2016, ICFP.

[9]  Peter Lammich,et al.  Generating Verified LLVM from Isabelle/HOL , 2019, ITP.

[10]  Simon Wimmer,et al.  Formalized Timed Automata , 2016, ITP.

[11]  Peter Lammich.  Refinement to Imperative/HOL , 2015, ITP.

[12]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[13]  Dirk Beyer,et al.  Rabbit: A Tool for BDD-Based Verification of Real-Time Systems , 2003, CAV.