|
ABSTRACT
We study a variant of Levi and Sangiorgi's Safe Ambients (SA) enriched with passwords (SAP). In SAP by managing passwords, for example generating new ones and distributing them selectively, an ambient may now program who may migrate into its computation space, and when. Moreover in SAP an ambient may provide different services depending on the passwords exhibited by its incoming clients.We give an lts based operational semantics for SAP and a labelled bisimulation based equivalence which is proved to coincide with barbed congruence.Our notion of bisimulation is used to prove a set of algebraic laws which are subsequently exploited to prove more significant examples.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
Luca Cardelli and Andrew Gordon. A commitment relation for the ambient calculus. Unpublished notes, 1996.
|
 |
3
|
|
 |
4
|
Luca Cardelli , Andrew D. Gordon, Anytime, anywhere: modal logics for mobile ambients, Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.365-377, January 19-21, 2000, Boston, MA, USA
[doi> 10.1145/325694.325742]
|
| |
5
|
|
| |
6
|
M. Hennessy and a. Rathke. Typed behavioural equivalences for processes in the presence of subtyping. Computer Science Report 2/01, University of Sussex, 2001.
|
| |
7
|
|
 |
8
|
|
| |
9
|
M. Merro and M. Hennessy. Bisimulation congruences in safe ambients. Computer Science Report 5/01, University of Sussex, 2001.
|
| |
10
|
|
| |
11
|
|
| |
12
|
|
| |
13
|
D. Sangiorgi. Eaprvssing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis CST 99-93, Department of Computer Science, University of Edinburgh, 1992.
|
| |
14
|
|
| |
15
|
|
 |
16
|
|
| |
17
|
|
| |
18
|
Maria Grazia Vigliotti. Transitions systems for the ambient calculus. Master thesis, Imperial College of Science, Technology and Medicine (University of London), September 1999.
|
| |
19
|
|
|