AbstractThis paper introduces a process calculus designed to capture the phenomenon of names which are known universally but always refer to local information. Our system extends the π-calculus so that a channel name can have within its scope several disjoint local areas. Such a channel name may be used for communication within an area, it may be sent between areas, but it cannot itself be used to transmit information from one area to another. Areas are arranged in a hierarchy of levels, distinguishing for example between a single application, a machine, or a whole network. We give an operational semantics for the calculus, and develop a type system that guarantees the proper use of channels within their local areas. We illustrate with mode...
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...
AbstractWe define a lexically scoped, asynchronous and distributed π-calculus, with local communicat...
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...
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...
All computers on the Internet are connected, but not all connections are equal. Hosts are grouped i...
We show how the #-calculus can express local communications within a distributed system, through an ...
AbstractThis paper presents a generalization of distributed π-calculi to support a hierarchy of loca...
AbstractWe define a lexically scoped, asynchronous and distributed π-calculus, with local communicat...
AbstractWe address the problem of handling names in concurrent and distributed systems made up of mo...
AbstractThe Seal Calculus is a process language for describing mobile computation. Threads and resou...
AbstractWe present a model of distributed computation which is based on a fragment of the π-calculus...
In present-day computing environments, a user often employs programs which are sent or fetched from ...
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...
AbstractWe define a lexically scoped, asynchronous and distributed π-calculus, with local communicat...
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...
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...
All computers on the Internet are connected, but not all connections are equal. Hosts are grouped i...
We show how the #-calculus can express local communications within a distributed system, through an ...
AbstractThis paper presents a generalization of distributed π-calculi to support a hierarchy of loca...
AbstractWe define a lexically scoped, asynchronous and distributed π-calculus, with local communicat...
AbstractWe address the problem of handling names in concurrent and distributed systems made up of mo...
AbstractThe Seal Calculus is a process language for describing mobile computation. Threads and resou...
AbstractWe present a model of distributed computation which is based on a fragment of the π-calculus...
In present-day computing environments, a user often employs programs which are sent or fetched from ...
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...
AbstractWe define a lexically scoped, asynchronous and distributed π-calculus, with local communicat...