Anytime, anywhere: modal logics for mobile ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Information and Computation - Special issue on EXPRESS 1997
Theoretical Computer Science
Model checking mobile ambients
Theoretical Computer Science
On the expressive power of movement and restriction in pure mobile ambients
Theoretical Computer Science - Special issue: Foundations of wide area network computing
On the computational strength of pure ambient calculi
Theoretical Computer Science - Expressiveness in concurrency
When ambients cannot be opened
Theoretical Computer Science - Foundations of software science and computation structures
Reachability analysis of fragments of mobile ambients in AC term rewriting
Formal Aspects of Computing
Deciding reachability in mobile ambients
ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
Reachability problems in BioAmbients
Theoretical Computer Science
Multiset rewriting for the verification of depth-bounded processes with name binding
Information and Computation
| Hi-index | 0.00 |
We investigate the reachability problem for fragments of the Mobile Ambients, a powerful model for distributed and mobile computation. By using a connection with associative-commutative term rewriting, we prove that reachability is decidable in the open-free fragment of pure Mobile Ambients with name restriction and weak reduction semantics. Processes in this model have three sources of infiniteness: depth of ambients, width of parallel composition, and number of restricted names. Our work extends similar results obtained for public fragments of Mobile Ambients.