Joost-Pieter Katoen
Paper accepted by Theoretical Computer Science
The paper “Confluence Reduction for Markov Automata” by Mark Timmer, Joost-Pieter Katoen, Jaco van de Pol and Marielle Stoelinga has been accepted for the journal Theoretical Computer Science. The paper describes an on-the-fly symbolic reduction technique for Markov automata akin to partial-order reduction. Experiments show that up to 90% of the potential reductions that could […]
Paper accepted at ESOP 2016
The paper “Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs” by Benjamin Kaminski, Joost-Pieter Katoen, Christoph Matheja and Federico Olmedo has been accepted for publication at ESOP 2016. The paper presents a wp-calculus for probabilistic programs to analyse their expected run-times, together with a set of proof rules for loops, and shows its application to […]
Paper accepted at TACAS 2016
The paper “Safety-constrained Reinforcement Learning for MDPs” by Sebastian Junges, Nils Jansen, Christian Dehnert, Ufuk Topcu and Joost-Pieter Katoen has been accepted at TACAS 2016 (acceptance rate 25,7%). The paper addresses the problem: Given an MDP with a cost structure, synthesize an optimal policy subject to safety constraints. In particular, the costs of actions are […]
Mysuru 2016 Workshop on Quantitative Verification
We co-organise the Mysuru 2016 Workshop “Trends and Challenges in Quantitative Verification”, together with Igor Walukiewicz, Srivathsan, and Akshay, early February. Further details can be found here.
Paper in Top-100 most cited papers in Software Engineering
The 2003 IEEE TSE paper “Model-Checking Algorithms for Continuous-Time Markov Chains” by Christel Baier, Boudewijn Haverkort, Holger Hermanns, and Joost-Pieter Katoen is ranked 74 in the top-100 of most cited papers in software engineering (and ranked 57 in the top-100 when considering number of citations per year). The top-100 has recently been published in Information […]
Paper accepted by Formal Methods in System Design
The paper entitled “Efficient GPU Algorithms for Parallel Decomposition of Graphs into Strongly Connected and Maximal End Components” by Anton Wijs, Joost-Pieter Katoen, and Dragan Boshnacki, has been accepted to the special issue of the journal FMSD devoted to CAV 2014.
Talk on Conditioning accepted at POPL PPS workshop
The talk on “On the Semantic Intricacies of Conditioning” has been accepted for presentation at the Probabilistic Programming Semantics (PPS) workshop at POPL’16.
Friedrich Gretz successfully defended his Ph.D. dissertation
Friday September 26, Friedrich Gretz successfully defended his PhD dissertation, entitled “Semantics and Loop Invariant Synthesis for Probabilistic Programs” for a jury consisting of Sriram Sankaranarayanan (Boulder, USA), Stefan Kowalewski, Jürgen Giesl, and Joost-Pieter Katoen (all Aachen). Friedrich’s dissertation studies weakest pre-condition semantics, relates this to operational semantics, and extends this to including observations. In addition, […]
CAV 2015
Our new PROPhESY tool for parameter synthesis of Markov chains has been elected (out of 30 artefacts) as runner-up in the Artifact Evaluation at CAV 2015. In addition, Joost-Pieter Katoen gave a three-hour tutorial on probabilistic verification. The tutorial slides can be found here.
Sebastian Junges receives prize for excellent master studies
Sebastian Junges received on last Friday (June 26) a price for his excellent achievements in his master studies Computer Science. Sebastian recently completed his master thesis on “Simplifying Dynamic Fault Trees by Graph Rewriting” and was co-supervised by Marielle Stoelinga (Twente). We congratulate Sebastian with this great result!