Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Author supplied keywords
Cite
CITATION STYLE
Kitamura, T., & Lin, H. (2007). Controlling process modularity in mobile computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4711 LNCS, pp. 246–259). Springer Verlag. https://doi.org/10.1007/978-3-540-75292-9_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
