When Ambients Cannot be Opened - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Theoretical Computer Science Year : 2005

When Ambients Cannot be Opened


We investigate expressiveness of a fragment of the ambient calculus, a formalism for describing distributed and mobile computations. More precisely, we study expressiveness of the pure and public ambient calculus from which the capability open has been removed, in terms of the reachability problem of the reduction relation. Surprisingly, we show that even for this very restricted fragment, the reachability problem is not decidable. At a second step, for a slightly weaker reduction relation, we prove that reachability can be decided by reducing this problem to markings reachability for Petri nets. Finally, we show that the name-convergence problem as well as the model-checking problem turn out to be undecidable for both the original and the weaker reduction relation.

Dates and versions

inria-00536689 , version 1 (16-11-2010)



Iovka Boneva, Jean-Marc Talbot. When Ambients Cannot be Opened. Theoretical Computer Science, 2005, 2 (333), pp.127-169. ⟨10.1016/j.tcs.2004.10.020⟩. ⟨inria-00536689⟩
47 View
0 Download



Gmail Facebook Twitter LinkedIn More