When Ambients Cannot be Opened

Abstract : 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.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 2005, 2 (333), pp.127-169
Liste complète des métadonnées

Contributeur : Iovka Boneva <>
Soumis le : mardi 16 novembre 2010 - 17:31:12
Dernière modification le : vendredi 26 octobre 2018 - 16:42:10


  • HAL Id : inria-00536689, version 1



Iovka Boneva, Jean-Marc Talbot. When Ambients Cannot be Opened. Theoretical Computer Science, Elsevier, 2005, 2 (333), pp.127-169. 〈inria-00536689〉



Consultations de la notice