Algebraic theory of processes
Communication and concurrency
A calculus of mobile processes, I
Information and Computation
A language with distributed scope
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Theoretical Computer Science
Nomadic pict: correct communication infrastructure for mobile computation
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Resource access control in systems of mobile agents
Information and Computation
Information and Computation
Mobile objects as mobile processes
Information and Computation - IFIP TCS2000
Global/Local Subtyping and Capability Inference for a Distributed pi-calculus
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Bisimulation in Name-Passing Calculi without Matching
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Communication and mobility control in boxed ambients
Information and Computation
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Space-aware ambients and processes
Theoretical Computer Science
Theoretical Computer Science
Basic observables for a calculus for global computing
Information and Computation
Boxed ambients with communication interfaces
Mathematical Structures in Computer Science
A theory of system behaviour in the presence of node and link failure
Information and Computation
Mobility control via passports
Information and Computation
Parametrised Constants and Replication for Spatial Mobility
COORDINATION '09 Proceedings of the 11th International Conference on Coordination Models and Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
History-based access control for distributed processes
TGC'05 Proceedings of the 1st international conference on Trustworthy global computing
A theory for observational fault tolerance
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Proof methodologies for behavioural equivalence in DPI
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Mobility control via passports
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Hi-index | 0.00 |
We define a typed bisimulation equivalence for the language DPI, a distributed version of the π-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.