Abstract
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.
Cite
CITATION STYLE
Wimmer, S. (2019). Munta: A Verified Model Checker for Timed Automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11750 LNCS, pp. 236–243). Springer. https://doi.org/10.1007/978-3-030-29662-9_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
