In comparative concurrency semantics, one usually distinguishes between linear time and
branching time semantic equivalences. Milner's notion of observatin equivalence is often …

Induction is a pervasive tool in computer science and mathematics for defining objects and
reasoning on them. Coinduction is the dual of induction and as such it brings in quite …

This paper studies semantic equivalences and preorders for sequential systems with silent
moves, restricting attention to the ones that abstract from successful termination, stochastic …

Comparing the expressive power of the synchronous and asynchronous $pi$-calculi Page 1
Math. Struct. in Comp. Science (2003), vol. 13, pp. 685–719. c 2003 Cambridge University Press …

In these notes, we give an overview of the join calculus, its semantics, and its equational
theory. The join calculus is a language that models distributed and mobile programming. It is …

The Asynchronous π-calculus, as recently proposed by Boudol and, independently, by
Honda and Tokoro, is a subset of the π-calculus which contains no explicit operators for …

The π-calculus with synchronous output and mixed-guarded choices is strictly more
expressive than the π-calculus with asynchronous output and no choice. This result was …

We study two encodings of the asynchronous π-calculus with input-guarded choice into its
choice-free fragment. One encoding is divergence-free, but refines the atomic commitment of …

Bisimulation up-to enhances the coinductive proof method for bisimilarity, providing efficient
proof techniques for checking properties of different kinds of systems. We prove the …

We study two encodings of the asynchronous π-calculus with input-guarded choice into its
choice-free fragment. One encoding is divergence-free, but refines the atomic commitment of …