We 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
AbstractThis paper studies a restricted version of the ambient calculus, a process model for mobile ...
We define a lexically scoped, asynchronous and distributed #-calculus, with local communication and ...
We define the syntax, the operational semantics, and a type system for lsd-pi, an asynchronous and d...
AbstractWe show how the π-calculus can express local communications within a distributed system, thr...
AbstractWe show how the π-calculus can express local communications within a distributed system, thr...
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...
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...
We address the problem of handling names in concurrent and distributed systems made up of mobile pro...
Abstract. We introduce two different ways of describing communication-centric software in the form o...
AbstractWe extend the π-calculus with polyadic synchronisation, a generalisation of the communicatio...
We define the syntax, the operational semantics, and a type system for lsd-pi, an asynchronous and d...
In this paper we study an asynchronous distributed #-calculus, with constructs for localities and mi...
AbstractThis paper studies a restricted version of the ambient calculus, a process model for mobile ...
We define a lexically scoped, asynchronous and distributed #-calculus, with local communication and ...
We define the syntax, the operational semantics, and a type system for lsd-pi, an asynchronous and d...
AbstractWe show how the π-calculus can express local communications within a distributed system, thr...
AbstractWe show how the π-calculus can express local communications within a distributed system, thr...
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...
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...
We address the problem of handling names in concurrent and distributed systems made up of mobile pro...
Abstract. We introduce two different ways of describing communication-centric software in the form o...
AbstractWe extend the π-calculus with polyadic synchronisation, a generalisation of the communicatio...
We define the syntax, the operational semantics, and a type system for lsd-pi, an asynchronous and d...
In this paper we study an asynchronous distributed #-calculus, with constructs for localities and mi...
AbstractThis paper studies a restricted version of the ambient calculus, a process model for mobile ...
We define a lexically scoped, asynchronous and distributed #-calculus, with local communication and ...
We define the syntax, the operational semantics, and a type system for lsd-pi, an asynchronous and d...