34 citations · 54 across the 10 of their papers we have counts for
7 papers
Certificates for Probabilistic Pushdown Automata via Optimistic Value Iteration
Tobias Winkler, Joost-Pieter Katoen
Probabilistic pushdown automata (pPDA) are a standard model for discrete probabilistic programs with procedures and recursion. In pPDA, many quantitative properties are characteriz…
Parameter Synthesis in Markov Models: A Gentle Survey
Nils Jansen, Sebastian Junges, Joost-Pieter Katoen
This paper surveys the analysis of parametric Markov models whose transitions are labelled with functions over a finite set of parameters. These models are symbolic representations…
Probabilistic Model Checking for Complex Cognitive Tasks -- A case study in human-robot interaction
Sebastian Junges, Nils Jansen, Joost-Pieter Katoen +1
This paper proposes to use probabilistic model checking to synthesize optimal robot policies in multi-tasking autonomous systems that are subject to human-robot interaction. Given…
The Probabilistic Model Checker Storm (Extended Abstract)
Christian Dehnert, Sebastian Junges, Joost-Pieter Katoen +1
We present a new probabilistic model checker Storm. Using state-of-the-art libraries, we aim for both high performance and versatility. This extended abstract gives a brief overvie…
Proving Linearizability via Branching Bisimulation
Xiaoxiao Yang, Joost-Pieter Katoen, Huimin Lin +1
Linearizability and progress properties are key correctness notions for concurrent objects. However, model checking linearizability has suffered from the PSPACE-hardness of the tra…
Analyzing Expected Outcomes and Almost-Sure Termination of Probabilistic Programs is Hard
Benjamin Lucien Kaminski, Joost-Pieter Katoen
This paper considers the computational hardness of computing expected outcomes and deciding almost-sure termination of probabilistic programs. We show that deciding almost-sure ter…