The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The anatomy of a context-aware application
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Theoretical Computer Science
Resource access control in systems of mobile agents
Information and Computation
Handbook of Process Algebra
Location-Independent Communication for Mobile Agents: A Two-Level Architecture
ICCL'98 Workshop on Internet Programming Languages
A Calculus of Mobile Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
An Asynchronous Model of Locality, Failurem and Process Mobility
COORDINATION '97 Proceedings of the Second International Conference on Coordination Languages and Models
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Nomadic Pict: Language and Infrastructure Design for Mobile Agents
ASAMA '99 Proceedings of the First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents
The receptive distributed π-calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
A variant of π-calculus which can flexibly and dynamically control process modularity is presented. The calculus is equipped with a two level structure to represent process distribution and mobility over flat locations. It provides a suitable model for modular programming in concurrent and mobile computing. Several bisimulation relations are discussed, and a notion of bisimulation-preorder is proposed to reflect some aspects of mobile distributed computing such as interaction costs.