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 …

Bergstra and Klop have shown that bisimilarity has a finite equational axiomatisation over
ACP/CCS extended with the binary left and communication merge operators. Moller proved …

We first present a probabilistic version of ACP that rests on the principle that probabilistic
choices are always resolved before choices involved in alternative composition and parallel …

A notion of branching bisimilarity for the alternating model of probabilistic systems,
compatible with parallel composition, is defined. For a congruence result, an internal …

This survey reviews some of the most recent achievements in the saga of the axiomatisation
of parallel composition, along with some classic results. We focus on the recursion …

This paper presents a general technique for obtaining new results pertaining to the non-
finite axiomatizability of behavioural (pre) congruences over process algebras from old …

A substantial amount of today's engineering problems revolve around systems that are
concurrent and stochastic by their nature. Solution approaches attacking these problems …

The well-known process algebras, such as CCS, ACP and $\pi $-calculus, capture the
interleaving concurrency based on bisimilarity semantics. We did some work on truly …

This paper proposes a notion of branching bisimilarity for non-deterministic probabilistic
processes. In order to characterize the corresponding notion of rooted branching …

This paper concerns instruction sequences that contain probabilistic instructions, ie
instructions that are themselves probabilistic by nature. We propose several kinds of …