Combining probabilistic choice and non-determinism is a long standing problem in
denotational semantics. From a category theory perspective, the problem stems from the …

We address the task of deriving fixpoint equations from modal logics characterizing
behavioural equivalences and metrics (summarized under the term conformances). We rely …

This paper studies trace-based equivalences for systems combining nondeterministic and
probabilistic choices. We show how trace semantics for such processes can be recovered by …

The monad of convex sets of probability distributions is a well-known tool for modelling the
combination of nondeterministic and probabilistic computational effects. In this work we lift …

The development of quantum communication protocols sparked the interest in quantum
extensions of process calculi and behavioural equivalences, but defining a bisimilarity that …

We introduce Probabilistic Regular Expressions (PRE), a probabilistic analogue of regular
expressions denoting probabilistic languages in which every word is assigned a probability …

State-based models of concurrent systems are traditionally considered under a variety of
notions of process equivalence. In the particular case of labelled transition systems, these …

We develop a modular method to build algebraic structures. Our approach is categorical: we
describe the layers of our construct as monads, and combine them using distributive laws …

We study monads resulting from the combination of nondeterministic and probabilistic
behaviour with the possibility of termination, which is essential in program semantics. Our …

Behavioural distances provide a fine-grained measure of equivalence in systems involving
quantitative data, such as probabilistic, fuzzy, or metric systems. Like in the classical setting …