Bisimulation Proof Methods for Mobile Ambients

  title={Bisimulation Proof Methods for Mobile Ambients},
  author={Massimo Merro and Francesco Zappa Nardelli},
We study the behavioural theory of Cardelli and Gordon's Mobile Ambients. We give an LTS based operational semantics, and a labelled bisimulation based equivalence that coincides with reduction barbed congruence. We also provide up-to proof techniques and prove a set of algebraic laws, including the perfect firewall equation. 
Behavioural Theory for Mobile Ambients
We study the behavioural theory of Cardelli and Gordon’s Mobile Ambients‚ by focusing on a standard contextual equivalence‚ reduction barbed congruence. We prove a context lemma that allows the
On the Operational Semantics of a Higher Order Safe Ambients Calculus
The reduction barbed congurence is given and the equivalence of extended labelled bisimulation and reduction barred congruence for this calculus is proved.
Applying a testing approach to the Calculus of Fair Ambients
It is proved that variant conditions on its definition do not change its discriminating power, and it is congruent on finite processes, and on a proper subset of processes, open bisimilarity is strictly included in testing equivalence.
A Uniform Reduction Equivalence for Process Calculi
We present a new uniform definition of reduction-based semantics for different process calculi, called indexed reduction equivalence (or congruence). We prove that early bisimulation coincides with
Using bisimulation proof techniques for the analysis of distributed abstract machines
  • D. Pous
  • Computer Science
    Theor. Comput. Sci.
  • 2008
Congruent Bisimulation Equivalence of Ambient Calculus Based on Contextual Transition System
  • M. Murakami
  • Computer Science
    2013 International Symposium on Theoretical Aspects of Software Engineering
  • 2013
A set of rules that derives transitions with contextual labels based on the LTS are presented and it is shown that the bisimulation equivalence is a congruence relation.
Using Bisimulation Proof Techniques for the Analysis of Distributed Algorithms Damien
This work defines a generic framework for the definition of distributed abstract machines based on a message-passing implementation, and focuses on the algorithm which is used to route messages asynchronously to their destination.
Using Bisimulation Proof Techniques for the Analysis of Distributed Algorithms 1;2
The use of recently developped proof techniques for weak bisimulation is illustrated by analysing a generic framework for the denition of distributed abstract machines based on a message-passing implementation and showing that in a second, optimised version, rather complex behaviours appear.
Proof methodologies for behavioural equivalence in D
This work devise a tractable collection of auxiliary proof methods, relying mainly on the use of bisimulations up-to β-reductions, which considerably relieve the burden of exhibiting witness bisimulation.
Bisimulation congruences for higher-order mobile embedded resources with local names
We present a calculus of Higher-Order Mobile Embedded Resources (Homer), extending Thomsen’s Plain CHOCS, a higher-order calculus with local names, to allow for strongly mobile computing resources in


On Bisimulations for the Asynchronous pi-Calculus
Bisimulation congruences in safe ambients
A variant of Levi and Sangiorgi's Safe Ambients enriched with passwords is studied and a labelled bisimulation based equivalence which is proved to coincide with barbed congruence is given.
The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity
A new version of the Seal Calculus, a calculus of mobile computation, is presented, which studies observational congruence and bisimulation theory, and shows how they are related.
Communication and concurrency
  • R. Milner
  • Computer Science
    PHI Series in computer science
  • 1989
This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
An efficiency preorder for processes
A simple efficiency preorder for CCS processes is introduced and is shown to be preserved by all CCS contexts except summation and it is used to analyse a non-trivial example: two different implementations of a bounded buffer.
Testing Equivalences for Processes
On Reduction-Based Process Semantics
A Calculus of Mobile Resources
We introduce a calculus of Mobile Resources (MR) tailored for the design and analysis of systems containing mobile, possibly nested, computing devices that may have resource and access constraints,an
Concurrency and Automata on Infinite Sequences
  • D. Park
  • Computer Science
    Theoretical Computer Science
  • 1981
A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.
Bisimulation for Higher-Order Process Calculi
A new form of bisimulation is proposed for higher-order process calculus, called context bisimulations, which yields a more satisfactory discriminanting power and is played by the factorisation theorem.