|
|
|
|
| LEADER |
01323 am a22001573u 4500 |
| 001 |
263366 |
| 042 |
|
|
|a dc
|
| 100 |
1 |
0 |
|a Hennessy, Matthew
|e author
|
| 100 |
1 |
0 |
|a Sassone, Vladimiro
|e contributor
|
| 700 |
1 |
0 |
|a Merro, Massimo
|e author
|
| 700 |
1 |
0 |
|a Rathke, Julian
|e author
|
| 245 |
0 |
0 |
|a Towards a behavioural theory of access and mobility control in distributed systems
|
| 260 |
|
|
|c 2004.
|
| 856 |
|
|
|z Get fulltext
|u https://eprints.soton.ac.uk/263366/1/tbtamcdsfull.pdf
|
| 520 |
|
|
|a We define a typed bisimulation equivalence for the language Dpi, a distributed version of the pi-calculus in which processes may migrate between dynamically created locations. It takes into account resource access policies, which can be implemented in Dpi using a novel form of dynamic capability types. The equivalence, based on typed actions between configurations, is justified by showing that it is fully-abstract with respect to a natural distributed version of a contextual equivalence. In the second part of the paper we study the effect of controlling the migration of processes. This affects the ability to perform observations at specific locations, as the observer may be denied access. We show how the typed actions can be modified to take this into account, and generalise the full-abstraction result to this more delicate scenario.
|
| 655 |
7 |
|
|a Article
|
