On the Distributability of Mobile Ambients

@article{Peters2018OnTD,
  title={On the Distributability of Mobile Ambients},
  author={Kirstin Peters and Uwe Nestmann},
  journal={CoRR},
  year={2018},
  volume={abs/1808.09361},
  pages={104-121}
}
Modern society is dependent on distributed software systems and to verify them different modelling languages such as mobile ambients were developed. 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… 

Figures from this paper

On the Distributability of Mobile Ambients (Technical Report)

It turns out that mobile ambients are not fully distributed, because they can express enough synchronisation to express a synchronisation pattern called M, but can express strictly less synchronisation than the standard pi-calculus.

Distributability of mobile ambients

On the Expressiveness of Mixed Choice Sessions

In spite of an inclusion of unrestricted channels with mixed choice, CMV +’s mixed choice is rather separate and not mixed, and it is shown that there exists no good encoding from the π -calculus into CMV, preserving distribution.

On the Expressiveness of Mixed Choice Sessions (Technical Report)

This technical report extends a paper presented at the workshop EXPRESS/SOS’22, showing that there exists no good encoding from the π -calculus into CMV + , preserving distribution and proving its soundness and thereby that the encoding is good up to coupled similarity.

References

SHOWING 1-10 OF 22 REFERENCES

On the Distributability of Mobile Ambients (Technical Report)

It turns out that mobile ambients are not fully distributed, because they can express enough synchronisation to express a synchronisation pattern called M, but can express strictly less synchronisation than the standard pi-calculus.

On Distributability in Process Calculi

It is proved that there is no good and distributability-preserving encoding from the synchronous pi-calculus with mixed choice into its fragment with only separate choice, and neither from the asynchronous pi-Calculus (without choice) into the join-cal calculus.

Mobile safe ambients

Type systems for controlling mobility appear to be more powerful in SA, in that (i) type systems for MA may give more precise information when transplanted onto SA, and (ii) new type systems may be defined.

A Calculus of Mobile Processes, Part I

The paper continues by presenting the algebraic theory of strong bisimilarity and strong equivalence, including a new notion of equivalence indexed by distinctions, based upon a semantics in terms of a labelled transition system and a notion of weak bisimulation, both of which are expounded in detail in a companion paper.

An Asynchronous, Distributed Implementation of Mobile Ambients

A first distributed implementation of the Cardelli-Gordon's ambient calculus is presented and a formal translation of Ambients into the distributed join calculus, the process calculus associated with Jocaml is presented.

A distributed Pi-calculus

This book proposes a distributed pi-calculus called Dpi, for describing the behaviour of mobile agents in a distributed world, based on an existing formal language, the pi-Calculus, to which it adds a network layer and a primitive migration construct.

Towards a unified approach to encodability and separation results for process calculi

  • D. Gorla
  • Computer Science
    Inf. Comput.
  • 2010

Jocaml: mobile agents for Objective-Caml

  • S. ConchonF. L. Fessant
  • Computer Science
    Proceedings. First and Third International Symposium on Agent Systems Applications, and Mobile Agents
  • 1999
The Jocaml programming model and language, its current implementation and some interesting applications are described.

Translational Expressiveness. Comparing Process Calculi using Encodings

Different variants of operational correspondence may arise from different requirements on the assumed equivalence T on the target language, because also observables have to be preserved and reflected in some sense.

Some Results in the Joint-Calculus

The join-calculus is a model for distributed programming languages with migratory features based on static scope and an explicit notion of locality and failures that allows standard polymorphic ML-like typing and thus an integration in a realistic programming language.