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.

Bisimulation proof methods for mobile ambients

MERRO, Massimo;
2003

Abstract

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.
3540404937
Mobile Computing; Operational Semantics; Bisimulation
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11562/16680
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 28
  • ???jsp.display-item.citation.isi??? 11
social impact