An asynchronous, distributed implementation of mobile ambients
From MaRDI portal
Recommendations
Cited in
(27)- Pict correctness revisited
- Comparing communication primitives via their relative expressive power
- A hierarchy of equivalences for asynchronous calculi
- Distributability of mobile ambients
- Symmetric electoral systems for ambient calculi
- Explicit fusions
- The seal calculus
- Communication and mobility control in boxed ambients
- On an open problem of Amadio and Curien: The finite antichain condition
- A structured communication mechanism using mobile objects as ambassadors
- Structuring operational semantics: simplification and computation
- On the expressiveness of the -calculus and the mobile ambients
- On the expressiveness of -calculus for encoding mobile ambients
- On the distributability of mobile ambients
- Complete Lattices and Up-To Techniques
- Timers and Proximities for Mobile Ambients
- A Decentralized Implementation of Mobile Ambients
- A distributed abstract machine for safe ambients (extended abstract)
- scientific article; zbMATH DE number 2090160 (Why is no real title available?)
- Encoding distributed areas and local communication into the -calculus
- Programming Languages and Systems
- Recent Trends in Algebraic Development Techniques
- A decentralised graphical implementation of mobile ambients
- A taxonomy of process calculi for distribution and mobility
- PiDuce- A project for experimenting web services technologies
- An efficient abstract machine for safe ambients
- Using bisimulation proof techniques for the analysis of distributed abstract machines
This page was built for publication: An asynchronous, distributed implementation of mobile ambients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536436)