Abstract

The aim of the logic and probability strand is to construct tools for reasoning on probabilistic models. The simplest and most studied model is (labelled) Markov processes: such a process assumes a set of values called states, potentially infinite and even continuous, and the evolution is determined by a probability distribution depending only on the current state. Typical questions arising in practical applications are: how to identify two equivalent processes, how to abstract an infinite process into a finite one, how to assert that two processes have similar behaviour. A primary tool to tackle such questions is probabilistic bisimulation, which formalises equivalence of behaviors.

In this talk, we will discuss some of the recent results obtained during and after the semester, in particular, the link between probabilistic bisimulation and modal logic, as well as quantitative extensions of probabilistic bisimulation.

Presentation slides are in html format. The link is:
https://nathanael-fijalkow.github.io/Talk/Simons_Reunion/