I have started working in January 2021 on the project "Verified Probabilistic Verification". There are a multitude of ways to test whether systems or software work as intended. One such way is Probabilistic Model Checking (PMC). However, one of the core algorithms, value iteration, has been proven to be faulty. To restore the faith in PMC, I want to prove the correctness of these algorithms in the theorem prover "Isabelle/HOL". Then we use the Isabelle Refinement Framework to generate a fast correct-by-construction tool that can be used to validate other model checkers and that can even be fast enough to be embedded in existing model checkers such as in the Modest Toolset.
Hartmanns, A. , & Kohlen, B. (2022). Backwards Reachability for Probabilistic Timed Automata: A Replication Report. Paper presented at 1st Workshop on Reproducibility and Replication of Research Results, RRRR 2022, Garching, Germany. https://qcomp.org/rrrr/2022/papers/rrrr-2022-backwards-reachability-for-probabilistic-timed-automata.pdf
Hartmanns, A. , Katoen, J-P. , Kohlen, B., & Spel, J. (2021). Tweaking the Odds in Probabilistic Timed Automata. In A. Abate, & A. Marin (Eds.), Quantitative Evaluation of Systems - 18th International Conference, QEST 2021, Paris, France, August 23-27, 2021, Proceedings (pp. 39-58). (Lecture Notes in Computer Science; Vol. 12846). Springer. https://doi.org/10.1007/978-3-030-85172-9_3
Affiliated Study Programmes
Courses Academic Year 2022/2023
Courses in the current academic year are added at the moment they are finalised in the Osiris system. Therefore it is possible that the list is not yet complete for the whole academic year.