Randomization is a key element in sequential and distributed computing. Reasoning about
randomized algorithms is highly non-trivial. In the 1980s, this initiated first proof methods …

In view of the growing complexity of modern software architectures, formal models are
increasingly used to understand why a system works the way it does, opposed to simply …

Graph-based games are an important tool in computer science. They have applications in
synthesis, verification, refinement, and far beyond. We review graph-based games with …

In this paper we introduce a new analytical approach to environment compensation for
speech recognition. Previous attempts at solving analytically the problem of noisy speech …

The design and control of autonomous systems that operate in uncertain or adversarial
environments can be facilitated by formal modeling and analysis. Probabilistic model …

Statistical model checking (SMC) is a technique for analysis of probabilistic systems that
may be (partially) unknown. We present an SMC algorithm for (unbounded) reachability …

We provide a survey of the state of the art of rational verification: the problem of checking
whether a given temporal logic formula ϕ is satisfied in some or all game-theoretic equilibria …

We introduce Probabilistic Strategy Logic, an extension of Strategy Logic for stochastic
systems. The logic has probabilistic terms that allow it to express many standard solution …

We propose a general framework for modelling and formal reasoning about multi-agent
systems and, in particular, multi-stage games where both quantitative and qualitative …

Automated verification techniques for stochastic games allow formal reasoning about
systems that feature competitive or collaborative behaviour among rational agents in …