The Storm model checker received the second place at the RWTH Innovation Award 2020. An official announcement can be found here whereas a youtube video of the three winners is here (watch until the end).
The paper entitled “The Complexity of Reachability in Parametric Markov Decision Processes” by Sebastian Junges, Joost-Pieter Katoen, Guillermo Perez, and Tobias Winkler is accepted for publication in Journal of Computer and System Sciences. This paper provides several complexity results on parameter synthesis in parametric MDPs.
The paper “Scalable Reliability Analysis by Lazy Verification” by Shahid Khan, Joost-Pieter Katoen, Matthias Volk and Marc Bouissou has been accepted for the 13th NASA Formal Methods (NFM) Symposium. The paper presents an iterative method for the partial analysis of reliability (with repairs) models through lazy verification. The approach yields an upper and a lower […]
The paper “Markov Automata with Multiple Objectives” by Tim Quatmann, Sebastian Junges and Joost-Pieter Katoen has been accepted for publication in Formal Methods in System Design, a special issue for selected papers from CAV 2017. The paper presents several algorithms for automatically verifying multiple timed objectives on Markov automata, an extension of continuous-time Markov chains […]
Joost-Pieter Katoen has been elected as new member of the Royal Holland Society of Sciences and Humanities. The KHMW was established in 1752 and is the oldest society of sciences in the Netherlands. The official announcement (in Dutch) can be found here:
Prof. Joost-Pieter Katoen has been named ACM Fellow 2020 for his contributions to model checking of software and probabilistic systems. The ACM Fellows program recognizes the top 1% of ACM Members for their outstanding accomplishments in computing and information technology and/or outstanding service to ACM and the larger computing community. Fellows are nominated by their […]
We are happy to announce that our team (Joshua Moerman and Jana Berger) has won 5 gold medals at the RERS challenge 2020. By using a combination of off-the-shelf verification tools, they have managed to crack many of the reachability problems and LTL verification problems. To get more information, please read their report.
We are delighted to inform you that three MOVES papers have been accepted at TACAS 2021: “Inductive Synthesis for Probabilistic Programs Reaches New Horizons” by Roman Andriushchenko, Milan Ceska, Sebastian Junges and Joost-Pieter Katoen “Multi-objective Optimization of Long-run Average and Total Rewards” by Tim Quatmann and Joost-Pieter Katoen, and “Finding Provably Optimal Markov Chains” by Jip […]
The paper entitled “Automated Termination Analysis of Polynomial Probabilistic Programs ” by Marcel Moosbrugger, Ezio Bartocci, Joost-Pieter Katoen and Laura Kovács has been accepted for the European Symposium on Programming (ESOP 2021). The paper presents an algebraic approach and the publicly available tool Amber to automatically prove whether a probabilistic programs is almost-surely terminating (or […]
We are happy to announce that the paper A Pre-Expectation Calculus for Probabilistic Sensitivity by Alejandro Aguirre, Gilles Barthe, Justin Hsu, Benjamin Kaminski, Joost-Pieter Katoen and Christoph Matheja has been selected as distinguished POPL 2021 paper. The paper develops a logic for estimating sensitivity properties (how do changes in the inputs affect the program’s output?) […]