Tweaking the Odds in Probabilistic Timed Automata. - Arnd Hartmanns; Joost-Pieter Katoen; Bram Kohlen; Jip Spel (QEST, 2021)

Backwards Reachability for Probabilistic Timed Automata: A Replication Report. - Arnd Hartmanns; Bram Kohlen (CoRR, 2022)

Fast Verified SCCs for Probabilistic Model Checking. - Arnd Hartmanns; Bram Kohlen; Peter Lammich (ATVA (1), 2023)

Efficient Formally Verified Maximal End Component Decomposition for MDPs. - Arnd Hartmanns; Bram Kohlen; Peter Lammich (FM (1), 2024)

A Formally Verified IEEE 754 Floating-Point Implementation of Interval Iteration for MDPs. - Bram Kohlen; Maximilian Schäffeler; Mohammad Abdulaziz; Arnd Hartmanns; Peter Lammich (CAV (2), 2025)