The π-calculus is a model of concurrent computation based upon the notion of naming. It is
first presented in its simplest and original form, with the help of several illustrative …

We formulate a typed formalism for concurrency where types denote freely composable
structure of dyadic interaction in the symmetric scheme. The resulting calculus is a typed …

We introduce the spi calculus, an extension of the pi calculus designed for the description
and analysis of cryptographic protocols. We show how to use the spi calculus, particularly for …

We study the interaction of the programming construct “new,” which generates statically
scoped names, with communication via messages on channels. This interaction is crucial in …

By adding reflexion to the chemical machine of Berry and Boudol, we obtain a formal model
of concurrency that is consistent with mobility and distribution. Our model provides the …

The economy and flexibility of the pi-calculus make it an attractive object of theoretical study
and a clean basis for concurrent language design and implementation. However, such …

The π-calculus is a process algebra that supports mobility by focusing on the communication
of channels. Milner's presentation of the π-calculus includes a type system assigning arities …

A formulation of semantic theories for processes which does not rely on the notion of
observables or convergence is studied. The new construction is based solely on a reduction …

The π-calculus is a process algebra where processes interact by sending communication
links to each other. This paper is an overview of and introduction to its basic theory. We …

Molecular self-assembly, the formation of large structures by small pieces of matter sticking
together according to simple local interactions, is a ubiquitous phenomenon. A challenging …