Bisimilarity as an equivalence notion of systems has been central to process theory. Due to
the recent rise of interest in quantitative systems (probabilistic, weighted, hybrid, etc.) …

The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust
quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic …

This thesis explores proofs by coupling from the perspective of formal verification. Long
employed in probability theory and theoretical computer science, these proofs construct …

Proving compositionality of behavioral equivalence on state-based systems with respect to
algebraic operations is a classical and widely studied problem. We study a categorical …

Behavioural equivalences can be characterized via bisimulations, modal logics and spoiler-
defender games. In this paper we review these three perspectives in a coalgebraic setting …

We study the nature of applicative bisimilarity in λ-calculi endowed with operators for
sampling from contin-uous distributions. On the one hand, we show that bisimilarity, logical …

Logical characterizations of probabilistic bisimulation and simulation for Labelled Markov
Processes were given by Desharnais et al. These results hold for systems defined on …

We explore language semantics for automata combining probabilistic and nondeterministic
behaviors. We first show that there are precisely two natural semantics for probabilistic …

Bisimulation is a concept that captures behavioural equivalence of states in a variety of
types of transition systems. It has been widely studied in a discrete-time setting. The core of …

Bisimilarity is a central notion for coalgebras. In recent work, Geuvers and Jacobs suggest to
focus on apartness, which they define by dualising coalgebraic bisimulations. This yields the …