AbstractWe show how the π-calculus can express local communications within a distributed system, through an encoding of the local area π-calculus, an enriched system that explicitly represents names which are known universally but always refer to local information. Our translation replaces point-to-point communication with a system of shared local ethers; we prove that this preserves and reflects process behaviour. We give an example based on an internet service dæmon, and investigate some limitations of the encoding
AbstractWe address the problem of handling names in concurrent and distributed systems made up of mo...
The rapidly increasing demand for ubiquitous communication has led to the widespread use of wireless...
Abstract. We introduce two different ways of describing communication-centric software in the form o...
We show how the #-calculus can express local communications within a distributed system, through an ...
AbstractWe show how the π-calculus can express local communications within a distributed system, thr...
AbstractThis paper introduces a process calculus designed to capture the phenomenon of names which a...
This paper introduces a process calculus designed to capture the phenomenon of names which are known...
AbstractThis paper introduces a process calculus designed to capture the phenomenon of names which a...
All computers on the Internet are connected, but not all connections are equal. Hosts are grouped i...
We introduce local environments for mobile processes, expressed in π-calculus. Each local name is eq...
AbstractWe extend the π-calculus with polyadic synchronisation, a generalisation of the communicatio...
Parametrised replication and replication are common waysof expressing infinite computation in proces...
AbstractThis paper studies a restricted version of the ambient calculus, a process model for mobile ...
AbstractWe present the π-calculus, a calculus of communicating systems in which one can naturally ex...
In this paper we study an asynchronous distributed #-calculus, with constructs for localities and mi...
AbstractWe address the problem of handling names in concurrent and distributed systems made up of mo...
The rapidly increasing demand for ubiquitous communication has led to the widespread use of wireless...
Abstract. We introduce two different ways of describing communication-centric software in the form o...
We show how the #-calculus can express local communications within a distributed system, through an ...
AbstractWe show how the π-calculus can express local communications within a distributed system, thr...
AbstractThis paper introduces a process calculus designed to capture the phenomenon of names which a...
This paper introduces a process calculus designed to capture the phenomenon of names which are known...
AbstractThis paper introduces a process calculus designed to capture the phenomenon of names which a...
All computers on the Internet are connected, but not all connections are equal. Hosts are grouped i...
We introduce local environments for mobile processes, expressed in π-calculus. Each local name is eq...
AbstractWe extend the π-calculus with polyadic synchronisation, a generalisation of the communicatio...
Parametrised replication and replication are common waysof expressing infinite computation in proces...
AbstractThis paper studies a restricted version of the ambient calculus, a process model for mobile ...
AbstractWe present the π-calculus, a calculus of communicating systems in which one can naturally ex...
In this paper we study an asynchronous distributed #-calculus, with constructs for localities and mi...
AbstractWe address the problem of handling names in concurrent and distributed systems made up of mo...
The rapidly increasing demand for ubiquitous communication has led to the widespread use of wireless...
Abstract. We introduce two different ways of describing communication-centric software in the form o...