||On the Reachability Problem for Fragments of Mobile Ambients with Open and Restriction
||Giorgio Delzanno, Roberto Montagna
||We investigate the reachability problem for fragments of the Mobile Ambients with name restriction and the open capability. Both
name restriction and open are important and powerful programming abstractions for modeling realistic models of distributed computation. In
the present paper we will prove that the reachability problem is decidable in an open-free fragment of pure Mobile Ambients with name restriction and a weak reduction semantics for replication. Furthermore, we will prove that reachability remains decidable in the fragment of pure Mobile Ambients with weak reduction for replication in which we allow a limited use of the open capability. Our work extends the result on the decidability of reachability for open-free public Mobile Ambients with weak reduction recently proved by Boneva and Talbot.