Automatic verification of competitive stochastic systems
We present automatic verification techniques for the modelling and analysis of probabilistic
systems that incorporate competitive behaviour. These systems are modelled as turn-based …
systems that incorporate competitive behaviour. These systems are modelled as turn-based …
The mu-calculus and Model Checking
J Bradfield, I Walukiewicz - Handbook of Model Checking, 2018 - Springer
This chapter presents that part of the theory of the μ μ-calculus that is relevant to the model-
checking problem as broadly understood. The μ μ-calculus is one of the most important …
checking problem as broadly understood. The μ μ-calculus is one of the most important …
PRISM-games: verification and strategy synthesis for stochastic multi-player games with multiple objectives
M Kwiatkowska, D Parker, C Wiltsche - International Journal on Software …, 2018 - Springer
PRISM-games is a tool for modelling, verification and strategy synthesis for stochastic multi-
player games. These allow models to incorporate both probability, to represent uncertainty …
player games. These allow models to incorporate both probability, to represent uncertainty …
Automatic verification of concurrent stochastic systems
Automated verification techniques for stochastic games allow formal reasoning about
systems that feature competitive or collaborative behaviour among rational agents in …
systems that feature competitive or collaborative behaviour among rational agents in …
Value iteration for long-run average reward in Markov decision processes
Markov decision processes (MDPs) are standard models for probabilistic systems with non-
deterministic behaviours. Long-run average rewards provide a mathematically elegant …
deterministic behaviours. Long-run average rewards provide a mathematically elegant …
Permissive controller synthesis for probabilistic systems
We propose novel controller synthesis techniques for probabilistic systems modelled using
stochastic two-player games: one player acts as a controller, the second represents its …
stochastic two-player games: one player acts as a controller, the second represents its …
Symbolic verification and strategy synthesis for turn-based stochastic games
Stochastic games are a convenient formalism for modelling systems that comprise rational
agents competing or collaborating within uncertain environments. Probabilistic model …
agents competing or collaborating within uncertain environments. Probabilistic model …
Approximating a behavioural pseudometric without discount for probabilistic systems
F Van Breugel, B Sharma… - Logical Methods in …, 2008 - lmcs.episciences.org
Desharnais, Gupta, Jagadeesan and Panangaden introduced a family of behavioural
pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative …
pseudometrics for probabilistic transition systems. These pseudometrics are a quantitative …
PAC statistical model checking of mean payoff in discrete-and continuous-time MDP
C Agarwal, S Guha, J Křetínský… - … Conference on Computer …, 2022 - Springer
Markov decision processes (MDP) and continuous-time MDP (CTMDP) are the fundamental
models for non-deterministic systems with probabilistic uncertainty. Mean payoff (aka long …
models for non-deterministic systems with probabilistic uncertainty. Mean payoff (aka long …
Automated verification of concurrent stochastic games
We present automatic verification techniques for concurrent stochastic multi-player games
(CSGs) with rewards. To express properties of such models, we adapt the temporal logic …
(CSGs) with rewards. To express properties of such models, we adapt the temporal logic …