In recent years, formal methods have been extensively used in the design of autonomous
systems. By employing mathematically rigorous techniques, formal methods can provide …

Abstract Model checking undiscounted reachability and expected-reward properties on
Markov decision processes (MDPs) is key for the verification of systems that act under …

The classical problem of reachability in simple stochastic games is typically solved by value
iteration (VI), which produces a sequence of under-approxima-tions of the value of the …

A classic solution technique for Markov decision processes (MDP) and stochastic games
(SG) is value iteration (VI). Due to its good practical performance, this approximative …

While value iteration (VI) is a standard solution approach to simple stochastic games
(SSGs), it suffered from the lack of a stopping criterion. Recently, several solutions have …

Probabilistic model checking is a technique for formal automated reasoning about software
or hardware systems that operate in the context of uncertainty or stochasticity. It builds upon …

Stochastic games are a convenient formalism for modelling systems that comprise rational
agents competing or collaborating within uncertain environments. Probabilistic model …

Neuro-symbolic approaches to artificial intelligence, which combine neural networks with
classical symbolic techniques, are growing in prominence, necessitating formal approaches …

We present a generic strategy iteration algorithm (GSIA) to find an optimal strategy of a
simple stochastic game (SSG). We prove the correctness of GSIA, and derive a general …

We present version 2.0 of the Partial Exploration Tool (Pet), a tool for verification of
probabilistic systems. We extend the previous version by adding support for stochastic …