59 citations · 458 across the 94 of their papers we have counts for
5 papers · 1 filter
Markov Decision Processes with Sure Parity and Multiple Reachability Objectives
Raphaël Berthon, Joost-Pieter Katoen, Tobias Winkler
This paper considers the problem of finding strategies that satisfy a mixture of sure and threshold objectives in Markov decision processes. We focus on a single -regular object…
A Spectrum of Approximate Probabilistic Bisimulations
Timm Spork, Christel Baier, Joost-Pieter Katoen +2
This paper studies various notions of approximate probabilistic bisimulation on labeled Markov chains (LMCs). We introduce approximate versions of weak and branching bisimulation,…
Unknown Biases and Timing Constraints in Timed Automata
Darion Haase, Joost-Pieter Katoen
Timed automata are the formal model for real-time systems. Extensions with discrete probabilistic branching have been considered in the literature and successfully applied. Probabi…
Accurately Computing Expected Visiting Times and Stationary Distributions in Markov Chains
Hannah Mertens, Joost-Pieter Katoen, Tim Quatmann +1
We study the accurate and efficient computation of the expected number of times each state is visited in discrete- and continuous-time Markov chains. To obtain sound accuracy guara…
Natural Strategic Ability in Stochastic Multi-Agent Systems
Raphaël Berthon, Joost-Pieter Katoen, Munyque Mittelmann +1
Strategies synthesized using formal methods can be complex and often require infinite memory, which does not correspond to the expected behavior when trying to model Multi-Agent Sy…