Selected papers of the Second Workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
Comparing the expressive power of the synchronous and the asynchronous &pgr;-calculus
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The name discipline of uniform receptiveness
Theoretical Computer Science
Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
ACM Transactions on Programming Languages and Systems (TOPLAS)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A spatial logic for concurrency (part I)
Information and Computation - TACS 2001
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the expressiveness of pure safe ambients
Mathematical Structures in Computer Science
Logical properties of name restriction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Manipulating trees with hidden labels
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Hi-index | 0.00 |
This paper studies a restricted version of the ambient calculus, a process model for mobile and distributed computation. We only allow single-threaded ambients migrating in a network of immobile ambients, exchanging payloads, and delivering them. With this restriction, we arrive at a calculus free from grave interferences. In previous works, this is only possible by sophisticated type systems.We focus on the expressiveness of the restricted calculus. We show that we can still repeat Zimmer's encoding of name-passing in our calculus. Moreover, we prove a stronger operational correspondence result than Zimmer's. The proof takes advantage on a specification about the spatial structure and process distributions of the encoding that are invariant to reductions, using a novel spatial logic.