10 citations · 32 across the 16 of their papers we have counts for
4 papers · 1 filter
Out of Control: Reducing Probabilistic Models by Control-State Elimination
Tobias Winkler, Johannes Lehmann, Joost-Pieter Katoen
State-of-the-art probabilistic model checkers perform verification on explicit-state Markov models defined in a high-level programming formalism like the PRISM modeling language. T…
The Complexity of Reachability in Parametric Markov Decision Processes
Sebastian Junges, Joost-Pieter Katoen, Guillermo A. Pérez +1
This article presents the complexity of reachability decision problems for parametric Markov decision processes (pMDPs), an extension to Markov decision processes (MDPs) where tran…
Generating Functions for Probabilistic Programs
Lutz Klinkenberg, Kevin Batz, Benjamin Lucien Kaminski +3
This paper investigates the usage of generating functions (GFs) encoding measures over the program variables for reasoning about discrete probabilistic programs. To that end, we de…
Stochastic Games with Lexicographic Reachability-Safety Objectives
Krishnendu Chatterjee, Joost-Pieter Katoen, Maximilian Weininger +1
We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification,…