Computing the accessibility relation for the Ambient Calculus

We present some algorithms to compute the reductions of Ambient Calculus and to describe mobility and dynamic hierarchies of locations. The main idea is to treat each ambient program as a complex of a set-theoretical structure for describing the hierarchy of locations, a function for naming the nodes of the structure, and a function for registering the capabilities of each node. These complexes, named state-processes, can be seen as states for a propositional branching tree logic built upon the Ambient Calculus. We develop here, the algorithms for implementing the accessibility relation between the states of this logic. Our algorithms compute the evolution of the truth values for the atomical propositions during the firing of capabilities. The model presented in this paper permits to re-use algorithms for model checking temporal logic to approach the Ambient Calculus.