Fair ambients

Authors:
Yuxi Fu
Affiliations:
Shanghai Jiaotong University, BASICS, Department of Computer Science, 200030, Shanghai, China
Venue:
Acta Informatica
Year:
2007

Citing 0
Cited 4

Deriving Structural Labelled Transitions for Mobile Ambients

CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
On the expressiveness of interaction

Theoretical Computer Science
Deriving structural labelled transitions for mobile ambients

Information and Computation
A pure labeled transition semantics for the applied pi calculus

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Based on an analysis of the capability operators of the Calculus of Mobile Ambients, three fairness principles are proposed to safeguard the interactions of the ambients. The Calculus of Fair Ambient is designed to meet these fairness principles. A labeled transition semantics for the calculus is defined to support structural investigation. The bisimulation theory of the fair ambients is studied and two coincidence results are established. An expressiveness result of the calculus is formally established by proving that it contains the pi calculus as a sub-calculus.