1 citations · 1 across the 3 of their papers we have counts for
7 papers
On the Continuity of the Probabilistic Bisimilarity Distance
Syyeda Zainab Fatmi, Stefan Kiefer, David Parker +1
The probabilistic bisimilarity distance provides a quantitative measure of behavioural difference for labelled Markov chains, but it may be discontinuous under perturbations of the…
Robust Probabilistic Bisimilarity for Labelled Markov Chains
Syyeda Zainab Fatmi, Stefan Kiefer, David Parker +1
Despite its prevalence, probabilistic bisimilarity suffers from a lack of robustness under minuscule perturbations of the transition probabilities. This can lead to discontinuities…
UMB: A Unified Markov Binary Format for Probabilistic Model Checking (extended version)
Roman Andriushchenko, Arnd Hartmanns, Joshua Jeppson +5
This paper presents the unified Markov binary (UMB) format, an efficient, extensible, and well-supported explicit-state file format for representing a wide range of probabilistic s…
Optimization-Based Robust Permissive Synthesis for Interval MDPs
Khang Vo Huynh, David Parker, Lu Feng
We present an optimization-based framework for robust permissive synthesis for Interval Markov Decision Processes (IMDPs), motivated by robotic decision-making under transition unc…
Robust Verification of Concurrent Stochastic Games
Angel Y. He, David Parker
Autonomous systems often operate in multi-agent settings and need to make concurrent, strategic decisions, typically in uncertain environments. Verification and control problems fo…
Learning Algorithms for Verification of Markov Decision Processes
Tomáš Brázdil, Krishnendu Chatterjee, Martin Chmelik +6
We present a general framework for applying learning algorithms and heuristical guidance to the verification of Markov decision processes (MDPs). The primary goal of our techniques…