On the expressive power of programming languages
ESOP '90 Selected papers from the symposium on 3rd European symposium on programming
A calculus of mobile processes, II
Information and Computation
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Resource access control in systems of mobile agents
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
Towards a behavioural theory of access and mobility control in distributed systems
Theoretical Computer Science - Special issue: Foundations of wide area network computing
A Distributed Pi-Calculus
Theoretical Computer Science
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On recursion, replication and scope mechanisms in process calculi
FMCO'06 Proceedings of the 5th international conference on Formal methods for components and objects
On the relative expressive power of asynchronous communication primitives
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Proof methodologies for behavioural equivalence in DPI
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
Parametrised replication and replication are common ways of expressing infinite computation in process calculi. While parametrised constants can be encoded using replication in the *** -calculus, this changes in the presence of spatial mobility as found in e.g. the distributed *** -calculus and the calculus of mobile ambients. Here, processes are located at sites and can migrate between them. In this paper we say that an encoding is local if it does not introduce extra migration. We first study this property for the distributed *** -calculus where locations can be dynamically created. If the set of reachable sites is static an encoding exists, but we also show that parametrised constants can not be encoded in the full calculus. The locality requirement supplements widely accepted encoding criteria. It appears to be a natural property in spatial calculi where links and locations can fail. The versions of the distributed *** -calculus with parametrised constants and replication are incomparable. On the other hand, we shall see that there exists a simple encoding of recursion in mobile ambients.