Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
424062 | Electronic Notes in Theoretical Computer Science | 2009 | 18 Pages |
Abstract
In this paper, we comparatively analyze some mainstream calculi for mobility: asynchronous π-calculus, distributed π-calculus and Mobile/Boxed/Safe ambients. In particular, we focus on their relative expressive power, i.e. we try to encode one in the other while respecting some reasonable properties. According to the possibility or the impossibility for such results, we set up a hierarchy of these languages.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics