Skip to main content
Journal Article

Bisimulation proof methods for mobile ambients

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2719 584-598
DOI: 10.1007/3-540-45061-0_47
28Citations
Citations of this article
16Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2003.

Cite

CITATION STYLE

APA

Merro, M., & Zappa Nardelli, F. (2003). Bisimulation proof methods for mobile ambients. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2719, 584–598. https://doi.org/10.1007/3-540-45061-0_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free