Joost-Pieter Katoen
Paper in JAIR
The paper entitled “Automatically Finding the Right Probabilities in Bayesian Networks” by Bahare Salmani and Joost-Pieter Katoen has been accepted for publication in the Journal of Artificial Intelligence Research. The paper presents a way to use probabilistic model checking to perform inference on Bayesian networks (BNs) and find suitable parameter values in the case of […]
Paper at OOPSLA 2023
The paper entitled “A Deductive Verification Infrastructure for Probabilistic Programs” by Philipp Schröer, Kevin Batz, Benjamin Kaminski (Saarland University and UCL), Joost-Pieter Katoen and Christoph Matheja (TU Denmark) has been accepted for publication at OOPSLA 2023. The paper presents a quantitative program verification infrastructure for discrete probabilistic programs. This infrastructure can be viewed as the […]
Paper in FMSD Journal
The paper “Parameter Synthesis for Markov Models: Covering the Parameter Space” by Sebastian Junges (Nijmegen), Erika Abraham, Christian Hensel (Amazon), Nils Jansen (Nijmegen), Joost-Pieter Katoen, Tim Quatmann and Matthias Volk (Twente) has been accepted for publication in the journal Formal Methods in Systems Design. The paper (85 pages) presents various analysis algorithms for parametric discrete-time Marko […]
Jean-Claude Laprie Award
The Jean-Claude Laprie Award 2023 in Dependable Computing has been awarded to the paper “Model-checking algorithms for continuous-time Markov chains”, authored by Christel Baier, Boudewijn Haverkort, Holger Hermanns, and Joost-Pieter Katoen, and published in IEEE Transactions on Software Engineering, 2003. It presents a unifying theory and algorithm to evaluate a wide variety of performance and […]
Paper at ESREL 2023
The paper entitled “SAFEST: the static and dynamic fault tree analysis tool” by Matthias Volk (Twente), Muzammil Ibne Irshad (DGB), Joost-Pieter Katoen, Falak Sher (DGB), Marielle Stoelinga (Twente) and Ahmad Zafar (DGB) has been accepted for presentation at the European Conference On Safety And Reliability (ESREL) 2023 in Southampton, UK. The paper presents a powerful […]
Paper at CAV 2023
The paper entitled “Search and Explore: Symbiotic Policy Synthesis in POMDPs” by Roman Andriushchenko (Brno University of Technology), Alexander Bork, Milan Ceska (Brno), Sebastian Junges (Radboud University, Netherlands), Joost-Pieter Katoen and Filip Macak (Brno) has been accepted for presentation at the 33th Conference on Computer-Aided Verification in Paris. The paper presents a symbiotic anytime algorithm that tightly integrates a belief-based […]
Paper at IJCAI 2023
The paper entitled “Finding an ϵ-Close Minimal Variation of Parameters in Bayesian Networks” by Bahare Salmani and Joost-Pieter Katoen has been accepted for presentation at IJCAI 2023 (the 32nd Int. Joint Conf. on Artificial Intelligence) in Macao. Out of 4566 full-paper submissions, about 15% has been accepted. The paper gives an algorithm for estimating the […]
Paper at LICS 2023
The paper entitled “On Certificates, Expected Runtimes, and Termination in ProbabilisticPushdown Automata” by Tobias Winkler and Joost-Pieter Katoen has been accepted for presentation at the IEEE/ACM Annual Symposium on Logic on Computer Science 2023 to be held in Boston. The paper studies certification of numerical characteristics of probabilistic pushdown systems, that is, how one can […]
Paper in IEEE TDSC
The paper entitled “A Compositional Semantics of Boolean-logic Driven Markov Processes” by Shahid Khan, Joost-Pieter Katoen andMarc Bouissou (EDF) has been accepted as regular paper for IEEE Transactions on Dependable and Secure Computing. This paper provides a compositional and operational semantics (using Markov automata) of BDMPs, a prominent dynamic extension of static fault trees to […]
Proceedings 25th FM Symposium
The proceedings of the 25th Symposium on Formal Methods (FM 2023), edited by Marsha Chechik (Toronto), Joost-Pieter Katoen and Martin Leucker (Lübeck), and published as LNCS volume 14000, are available from March 2 and accessible under: https://link.springer.com/book/10.1007/978-3-031-27481-7.