Abstract
Munta is a verified model checker for timed automata. It has been described in detail in a PhD thesis [3] and conference publications [4, 2]. This entry supersedes earlier versions of Munta hosted on GitHub.
License
Topics
Related publications
- Wimmer, S., & Lammich, P. (2018). Verified Model Checking of Timed Automata. Tools and Algorithms for the Construction and Analysis of Systems, 61–78. https://doi.org/10.1007/978-3-319-89960-2_4
- Wimmer, S. (2019). Munta: A Verified Model Checker for Timed Automata. Formal Modeling and Analysis of Timed Systems, 236–243. https://doi.org/10.1007/978-3-030-29662-9_14
- https://nbn-resolving.org/urn:nbn:de:bvb:91-diss-20201209-1576100-1-0
Session Munta_Base
- TA_Syntax_Bundles
- ML_Util
- Reordering_Quantifiers
- More_Methods
- Abstract_Term
- Bijective_Embedding
- Tracing
- Printing
- Trace_Timing
- Error_List_Monad
- Temporal_Logics
- Subsumption_Graphs
- Sepref_Acconstraint
- TA_DBM_Operations_Impl
- TA_More
- Normalized_Zone_Semantics_Impl
- TA_Impl_Misc
- Normalized_Zone_Semantics_Impl_Semantic_Refinement
- Normalized_Zone_Semantics_Impl_Refine
- Normalized_Zone_Semantics_Impl_Extra
Session Munta_Model_Checker
- Munta_Tagging
- Munta_Error_Monad_Add
- Parser_Combinator
- Lexer
- JSON_Parsing
- Networks
- State_Networks
- UPPAAL_Asm
- UPPAAL_Asm_Clocks
- UPPAAL_State_Networks
- UPPAAL_State_Networks_Impl
- Program_Analysis
- UPPAAL_State_Networks_Impl_Refine
- UPPAAL_Model_Checking
- Simple_Expressions
- Simple_Network_Language
- TA_Impl_Misc2
- TA_More2
- TA_Equivalences
- Simple_Network_Language_Impl
- Simple_Network_Language_Impl_Refine
- Simple_Network_Language_Model_Checking
- Deadlock
- Deadlock_Impl
- Deadlock_Checking
- Simple_Network_Language_Renaming
- Simple_Network_Language_Deadlock_Checking
- Shortest_SCC_Paths
- Simple_Network_Language_Export_Code
- Munta_Compile_MLton
Depends on
- AutoCorres2
- Certification Monads
- Code Generation for Functions as Data
- Verified Efficient Implementation of Gabow's Strongly Connected Components Algorithm
- A Compositional and Unified Translation of LTL into ω-Automata
- Haskell's Show Class in Isabelle/HOL
- Timed Automata
- Transition Systems and Automata
- Worklist Algorithms