On the Expressiveness of the pi-Calculus and the Mobile Ambients.

We investigate the expressivity of two classical distributed paradigms by defining an encoding of the pure mobile ambient calculus into the synchronous pi-calculus. We show that the encoding is complete and 'weakly' sound, since it may introduce loops. For this purpose we introduce the notions of simulating trace and of aborting trace.