Moves News

RTG UnRAVeL Extended

The DFG has granted the RTG 2236 UnRAVeL (Uncertainty and Randomness in Algorithms, Verification and Logic) an extension to 2026. The research training group has been granted 12 PhD positions as well as 10 student-assistant position to continue our research. The second phase of UnRAVeL involves 12 PIs from CS, Mechanical Engineering, Business Economics, and […]

Paper in IEEE TAC

The paper “Convex Optimization for Parameter Synthesis in MDPs” by Murat Cubuktepe, Nils Jansen, Sebastian Junges, Joost-Pieter Katoen and Ufuk Topcu has been accepted for publication in the journal IEEE Transactions on Automatic Control (impact factor 5,8). This paper formulates the feasibility problem for parametric MDPs (pMDPs) problem as a non-convex quadratically constrained quadratic program […]

Paper in Distributed Computing

The paper entitled “Synthesizing Optimal Bias in Randomized Self-Stabilization Algorithms” by Matthias Volk, Borzoo Bonakdarpour, Joost-Pieter Katoen and Saha Aflaki has been accepted for publication in the journal Distributed Computing. It presents a parameter-synthesis technique to automatically determine optimal biases of coin flips in randomised self-stabilisation algorithms.

Two papers at VMCAI 2022

Two papers of the MOVES group have been accepted at VMCAI 2022. The paper entitled “Out of Control: Reducing Probabilistic Models by Control-State Elimination” by Tobias Winkler, Johannes Lehmann and Joost-Pieter Katoen presents a static-analysis technique for reducing finite-state probabilistic models in the PRISM modeling language. The paper entitled “Gradient-Descent for Randomized Controllers under Partial […]

Paper at SEFM 2021

The tool paper entitled “A Debugger for Probabilistic Programs” by Alexander Hoppen and Thomas Noll has been accepted for presentation at the 19th International Conference on Software Engineering and Formal Methods (SEFM 2021). The paper presents both a theoretical foundation and a prototype implementation of a recording-based debugger for imperative probabilistic programs supporting randomised choice, […]

Paper at LADC 2021

The paper entitled “Modelling and Analysis of Fire Sprinklers by Verifying Dynamic Fault Trees” by Shahid Khan, Joost-Pieter Katoen, Matthias Volk, Ahmad Zafar and Falak Sher has been accepted for presentation at the 10th Latin-American Symposium on Dependable Computing (LADC 2021). The paper models fire sprinkler systems in shopping centers by dynamic fault trees and […]

Paper in STTT Journal

The paper entitled “DFT Modeling Approach for Operational Risk Assessment of RailwayInfrastructure” by Matthias Volk, Norman Weik (DLR), Nils Nie├čen, and Joost-Pieter Katoen has been accepted for publication in the journal Software Tools for Technology Transfer (STTT). The paper is an extension of the FMICS 2019 paper (awarded the best paper award) and presents a […]

Paper at PRDC 2021

The paper entitled “Synergising Reliability Modelling Languages: BDMPs and Repairable DFTs” by Shahid Khan and Joost-Pieter Katoen has been accepted for presentation at PRDC 2021, the IEEE Pacific Rim Dependability Conference. The paper proposes a translation from Boussiou’s BDMPs to repairable DFTs so as to use the repair mechanism of BDMP in rDFT. The validity […]

Paper at GandALF 2021

The paper entitled “Stochastic Games with Disjunctions of Multiple Objectives” by Tobias Winkler and Maxi Weininger (TU Munich) has been accepted for the Twelfth International Symposium on Games, Automata, Logics, and Formal Verification┬á(GandALF 2021). The paper provides new results on stochastic two-player games with disjunctive objectives given by an alternative of threshold conditions for the […]

Paper at FM 2021

The tool paper “The Probabilistic Termination Tool Amber” by Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen and Laura Kovacs has been accpted to FM2021, the conference on Formal Methods. The paper presents the first tool that automates the checking whether a probabilistic program is AST, PAST, non-AST, non-PAST, or “don’t know”. (AST = almost-sure termination, PAST […]