A partially deadlock-free typed process calculus
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
Types for the ambient calculus
Information and Computation - IFIP TCS2000
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Typing and Subtyping Mobility in Boxed Ambients
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
On Reduction Semantics for the Push and Pull Ambitent Calculus
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Access control for mobile agents: The calculus of boxed ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
A bisimulation-based semantic theory of Safe Ambients
ACM Transactions on Programming Languages and Systems (TOPLAS)
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
Towards a Unified Approach to Encodability and Separation Results for Process Calculi
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Communication and mobility control in boxed ambients
Information and Computation
Semantic barbs and biorthogonality
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Towards a unified approach to encodability and separation results for process calculi
Information and Computation
| Hi-index | 0.00 |
Nowadays, some of the most successful models for global computers are defined as ambient-based calculi; among them, the mainstream models are Mobile, Safe and Boxed Ambients. In this paper, we comparatively analyze them and most of their variants by comparing every variant against the language it comes from. In particular, we discuss and compare: objective moves in Mobile Ambients; passwords and a different semantics for the out primitive in Safe Ambients; different communication and mobility primitives in Boxed Ambients. By establishing the possibility/impossibility of encoding one language in another one, we relate the three main models and, for each of their variant, we discover whether it enhances the original language or actually yields a different formalism.