Formal methods for the specification and verification of hardware and software systems are
becoming more and more important as systems increase in size and complexity. The aim of …

This is a systematic and comprehensive introduction both to compositional proof methods for
the state-based verification of concurrent programs, such as the assumption-commitment …

In anonymous networks, the processors do not have identity numbers. We investigate the
following representative problems on anonymous networks:(a) the leader election …

Given a ring of n processors it is required to design the processors such that they will be
able to choose a leader (a uniquely designated processor) by sending messages along the …

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 …

We survey results from distributed computing that show tasks to be impossible, either
outright or within given resource bounds, in various models. The parameters of the models …

We introduce a labelled transition semantics for the reversible π-calculus. It is the first
account of a compositional definition of a reversible calculus, that has both concurrency …

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 …

This article surveys the field of implementation of concurrent logic programming languages. I
briefly review language semantics and programming paradigms, before summarizing the …