PRISM-games: A model checker for stochastic multi-player games

T Chen, V Forejt, M Kwiatkowska, D Parker… - … 2013, Held as Part of the …, 2013 - Springer
We present PRISM-games, a model checker for stochastic multi-player games, which
supports modelling, automated verification and strategy synthesis for probabilistic systems …

Run-time optimization for learned controllers through quantitative games

G Avni, R Bloem, K Chatterjee, TA Henzinger… - … Aided Verification: 31st …, 2019 - Springer
A controller is a device that interacts with a plant. At each time point, it reads the plant's state
and issues commands with the goal that the plant operates optimally. Constructing optimal …

On stochastic games with multiple objectives

T Chen, V Forejt, M Kwiatkowska, A Simaitis… - … of Computer Science …, 2013 - Springer
We study two-player stochastic games, where the goal of one player is to satisfy a formula
given as a positive boolean combination of expected total reward objectives and the …

[HTML][HTML] Quantitative verification and strategy synthesis for stochastic games

M Svoreňová, M Kwiatkowska - European Journal of Control, 2016 - Elsevier
Abstract Design and control of computer systems that operate in uncertain, competitive or
adversarial, environments can be facilitated by formal modelling and analysis. In this paper …

Synthesis for multi-objective stochastic games: An application to autonomous urban driving

T Chen, M Kwiatkowska, A Simaitis… - Quantitative Evaluation of …, 2013 - Springer
We study strategy synthesis for stochastic two-player games with multiple objectives
expressed as a conjunction of LTL and expected total reward goals. For stop** games, the …

Arena-independent finite-memory determinacy in stochastic games

P Bouyer, Y Oualhadj, M Randour… - Logical Methods in …, 2023 - lmcs.episciences.org
We study stochastic zero-sum games on graphs, which are prevalent tools to model decision-
making in presence of an antagonistic opponent in a random environment. In this setting, an …

On the complexity of model checking interval-valued discrete time Markov chains

T Chen, T Han, M Kwiatkowska - Information Processing Letters, 2013 - Elsevier
We investigate the complexity of model checking (finite) interval-valued discrete time Markov
chains, that is, discrete time Markov chains where each transition is associated with an …

Stochastic games for user journeys

P Kobialka, A Pferscher, GR Bergersen… - … Symposium on Formal …, 2024 - Springer
Industry is shifting towards service-based business models, for which user satisfaction is
crucial. User satisfaction can be analyzed with user journeys, which model services from the …

[HTML][HTML] Compositional strategy synthesis for stochastic games with multiple objectives

N Basset, M Kwiatkowska, C Wiltsche - Information and Computation, 2018 - Elsevier
Abstract Design of autonomous systems is facilitated by automatic synthesis of controllers
from formal models and specifications. We focus on stochastic games, which can model …

Automatic verification of competitive stochastic systems

A Simaitis - 2014 - ora.ox.ac.uk
In this thesis we present a framework for automatic formal analysis of competitive stochastic
systems, such as sensor networks, decentralised resource management schemes or …