The ambient calculus is a formalism for describing the mobility of both software and hardware. The ambient logic is a modal logic designed to specify properties of distributed and mobile computations programmed in the ambient calculus. In this paper we investigate the border between decidable and undecidable cases of model checking mobile ambients for some fragments of the ambient calculus and the ambient logic. Recently, Cardelli and Gordon presented a model-checking algorithm for a fragment of the calculus (without name restriction and without replication) against a fragment of the logic (without composition adjunct) and asked the question, whether this algorithm could be extended to include either replication in the calculus or composition adjunct in the logic. Here we answer this question negatively: it is not possible to extend the algorithm, because each of these extensions leads to undecidability of the problem. On the other hand, we extend the algorithm to the calculus with name restriction and logic with new constructs for reasoning about restricted names.
CITATION STYLE
Charatonik, W., & Talbot, J. M. (2001). The decidability of model checking mobile ambients. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2142, pp. 339–354). Springer Verlag. https://doi.org/10.1007/3-540-44802-0_24
Mendeley helps you to discover research relevant for your work.