Process algebras can be enriched with localities that explicitly describe the distribution of
processes. Localities may represent physical machines, or more generally distribution units …

The Seal calculus is a distributed process calculus with localities and mobility of
computational entities called seals. Seal is also a framework for writing secure distributed …

We describe a foundational language for specifying dynamically evolving networks of
distributed processes, Dπ. The language is a distributed extension of the π-calculus which …

Session types enable the specification and verification of communicating systems. However,
their theory often assumes that processes never fail. To address this limitation, we present a …

We examine extensions to the π-calculus for representing basic elements of distributed
systems. In spite of its expressiveness for encoding various programming constructs, some …

The Seal Calculus is a process language for describing mobile computation. Threads and
resources are tree structured; the nodes thereof correspond to agents, the units of mobility …

We study communication primitives for interaction between mobile agents. They can be
classified into two groups. At a low level there are location dependent primitives that require …

Recent advances in wireless networking technology and the increasing demand for
ubiquitous, mobile connectivity demonstrate the importance of providing reliable systems for …

Existing models for the analysis of concurrent processes tend to focus on fail-stop failures,
where processes are either working or permanently stopped, and their state …

This paper considers how locality restrictions on the use of capabilities can be enforced by a
static type system. A distributed π-calculus with a simple reduction semantics is introduced …