We introduce local environments for mobile processes, expressed in π-calculus. Each local name is equipped with its relative address, i.e., with the information needed to point back to the process that generated it. Relative addresses are built upon the labels of the proved transition system of π-calculus. A router is specified that guarantees sound exportation of names
AbstractThis paper introduces a process calculus designed to capture the phenomenon of names which a...
AbstractWe show how the π-calculus can express local communications within a distributed system, thr...
AbstractWe present a calculus for mobile systems, the main novel feature of which is the separation ...
We address the problem of handling names in distributed systems made of mobile processes. We equip p...
AbstractWe address the problem of handling names in concurrent and distributed systems made up of mo...
AbstractThis paper introduces a process calculus designed to capture the phenomenon of names which a...
There are many calculi for reasoning about concurrent communicating processes which have locations a...
There are many calculi for reasoning about concurrent communicating processes which have locations a...
In present-day computing environments, a user often employs programs which are sent or fetched from ...
AbstractWe present the π-calculus, a calculus of communicating systems in which one can naturally ex...
AbstractWe show how the π-calculus can express local communications within a distributed system, thr...
There are many calculi for reasoning about concurrent communicating processes which have locations a...
AbstractWe address the problem of handling names in concurrent and distributed systems made up of mo...
AbstractWe propose a simple model of distribution for mobile processes, independent of the underlyin...
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...
AbstractWe show how the π-calculus can express local communications within a distributed system, thr...
AbstractWe present a calculus for mobile systems, the main novel feature of which is the separation ...
We address the problem of handling names in distributed systems made of mobile processes. We equip p...
AbstractWe address the problem of handling names in concurrent and distributed systems made up of mo...
AbstractThis paper introduces a process calculus designed to capture the phenomenon of names which a...
There are many calculi for reasoning about concurrent communicating processes which have locations a...
There are many calculi for reasoning about concurrent communicating processes which have locations a...
In present-day computing environments, a user often employs programs which are sent or fetched from ...
AbstractWe present the π-calculus, a calculus of communicating systems in which one can naturally ex...
AbstractWe show how the π-calculus can express local communications within a distributed system, thr...
There are many calculi for reasoning about concurrent communicating processes which have locations a...
AbstractWe address the problem of handling names in concurrent and distributed systems made up of mo...
AbstractWe propose a simple model of distribution for mobile processes, independent of the underlyin...
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...
AbstractWe show how the π-calculus can express local communications within a distributed system, thr...
AbstractWe present a calculus for mobile systems, the main novel feature of which is the separation ...