Towards a behavioural theory of access and mobility control in distributed systems Export

@article{citeulike:1182147, abstract = {We define a typed bisimulation equivalence for the language D, 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 D 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.}, author = {Hennessy, Matthew and Merro, Massimo and Rathke, Julian}, booktitle = {Foundations of Wide Area Network Computing}, citeulike-article-id = {1182147}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.tcs.2003.12.024}, citeulike-linkout-1 = {http://www.sciencedirect.com/science/article/B6V1G-4C47DHP-2/2/6087193be6f837d77f10da511d3c4ba9}, day = {6}, doi = {10.1016/j.tcs.2003.12.024}, journal = {Theoretical Computer Science}, keywords = {distributed, picalculus}, month = {September}, number = {3}, pages = {615--669}, posted-at = {2007-03-23 22:24:55}, priority = {2}, title = {Towards a behavioural theory of access and mobility control in distributed systems}, url = {http://dx.doi.org/10.1016/j.tcs.2003.12.024}, volume = {322}, year = {2004} }

TY - JOUR ID - citeulike:1182147 L3 - citeulike-article-id:1182147 N2 - We define a typed bisimulation equivalence for the language D, 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 D 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. IS - 3 JF - Theoretical Computer Science EP - 669 TI - Towards a behavioural theory of access and mobility control in distributed systems VL - 322 T2 - Foundations of Wide Area Network Computing SP - 615 KW - distributed KW - picalculus AU - Hennessy, Matthew AU - Merro, Massimo AU - Rathke, Julian PY - 2004/09/06/ UR - http://dx.doi.org/10.1016/j.tcs.2003.12.024 ER -