Modern society is dependent on distributed software systems and to verify them different modelling languages such as mobile ambients were developed. They focus on mobility by allowing both a dynamic network topology as well as the movement of code within the network. To analyse the quality of mobile ambients as a good foundational model for distributed computation, we analyse the level of synchronisation between distributed components that they can express. Therefore, we rely on earlier established synchronisation patterns. It turns out that mobile ambients are not fully distributed, because they can express enough synchronisation to express a synchronisation pattern called $\mathsf{M}$. However, they can express strictly less synchronisation than the pi-calculus. For this reason, we can show that there is no good and distributability-preserving encoding from the pi-calculus into mobile ambients and also no such encoding from mobile ambients into the join-calculus, i.e., the expressive power of mobile ambients is in between these languages. Finally, we discuss how these results can be used to obtain a fully distributed variant of mobile ambients and present one example. Such a fully distributed variant of mobile ambients is a good foundation for distributed computation.

现代社会依赖于分布式软件系统，并且为了验证它们，开发了不同的建模语言，例如移动环境。他们通过允许动态网络拓扑以及网络内代码的移动来关注移动性。为了分析移动环境作为分布式计算的良好基础模型的质量，我们分析了它们可以表示的分布式组件之间的同步级别。因此，我们依靠较早建立的同步模式。事实证明，移动环境没有完全分布，因为它们可以表达足够的同步来表达称为$\mathsf{中号}$。但是，与pi演算相比，它们所表达的同步严格地更少。因此，我们可以证明从pi演算到移动环境中没有良好且可分配性的编码，也没有从移动环境到联接演算中的此类编码，即，移动环境的表达能力介于两者之间。这些语言。最后，我们讨论如何将这些结果用于获得移动环境的完全分布式变体，并给出一个示例。这种完全分布式的移动环境是分布式计算的良好基础。