On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
A &pgr;-calculus with explicit substitutions
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
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
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On Asynchrony in Name-Passing Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
A CPS encoding of name-passing in higher-order mobile embedded resources
Theoretical Computer Science - Expressiveness in concurrency
Name-passing in an ambient-like calculus and its proof using spatial logic
Theoretical Computer Science - Expressiveness in concurrency
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
When ambients cannot be opened
Theoretical Computer Science - Foundations of software science and computation structures
Tutorial on separation results in process calculi via leader election problems
Theoretical Computer Science
Symmetric electoral systems for ambient calculi
Information and Computation
Decidable Fragments of a Higher Order Calculus with Locations
Electronic Notes in Theoretical Computer Science (ENTCS)
On the Relative Expressive Power of Calculi for Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
When ambients cannot be opened
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
Encoding mobile ambients into the π-calculus
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
On the expressiveness of the π-calculus and the mobile ambients
AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Hi-index | 0.00 |
We consider the Pure Safe Ambient Calculus, which is Levi and Sangiorgi's Safe Ambient Calculus (a variant of Cardelli and Gordon's Mobile Ambient Calculus) restricted to its mobility primitives – in particular, we focus on its expressive power. Since it has no form of communication or substitution, we show how these notions can be simulated by mobility and modifications in the hierarchical structure of ambients. As a main result, we use these techniques to design an encoding of the synchronous $\pi$-calculus into pure ambients, and we study its correctness, thus showing that pure ambients are as expressive as the $\pi$-calculus. In order to simplify the proof and give an intuitive understanding of the encoding, we design an intermediate language, the $\pi$-Calculus with Explicit Substitutions and Channels, which is an extension of the $\pi$-calculus in which communication and substitution are broken into simpler steps, and we show that is has the same expressive power as the $\pi$-calculus.