Abstract
Mobile Ambients has been proposed by Cardelli and Gordon as a foundational calculus for mobile computing. Since its introduction, the computational strength as well as the decidability of properties have been investigated for several fragments and variants of the standard calculus. We tackle the problem of reachability and we characterize a public (i.e., restriction free) fragment for which it is decidable. This fragment is obtained by removing the open capability and restricting the use of replication to guarded processes. Quite surprisingly, this fragment has been shown to be Turing complete by Maffeis and Phillips.
Chapter PDF
References
Boneva, I., Talbot, J.-M.: When Ambients Cannot be Opened. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 169–184. Springer, Heidelberg (2003); Full version to appear in Theoretical Computer Science, Elsevier
Busi, N., Zavattaro, G.: On the Expressive Power of Movement and Restriction in Pure Mobile Ambients. Theoretical Computer Science 322, 477–515 (2004)
Busi, N., Zavattaro, G.: Deciding Reachability in Mobile Ambients - Extended version. Available at http://www.cs.unibo.it/busi/papersaMA05.pdf/
Cardelli, L., Ghelli, G., Gordon, A.D.: Types for the ambient calculus. Information and Computation 177(2), 160–194 (2002)
Cardelli, L., Gordon, A.D.: Mobile Ambients. Theoretical Computer Science 240(1), 177–213 (2000)
Cardelli, L., Gordon, A.D.: Anytime, anywhere: Modal logics for mobile ambients. In: Proc. of POPL 2000, pp. 365–377. ACM Press, New York (2000)
Cardelli, L., Gordon, A.D.: Ambient Logic. Mathematical Structures in Computer Science (to appear)
Maffeis, S., Phillips, I.: On the Computational Strength of Pure Mobile Ambients. To appear in Theoretical Computer Science, Elsevier (2004)
Merro, M., Hennessy, M.: Bisimulation congruences in safe ambients. In: Proc. of POPL 2002, pp. 71–80. ACM Press, New York (2002)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes. Journal of Information and Computation 100, 1–77 (1992)
Minsky, M.L.: Recursive Unsolvability of Post’s Problem of Tag and others Topics in the Theory of Turing Machines. Annals of Math. 74, 437–455 (1961)
Minsky, M.L.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)
Reutenauer, C.: The Mathematics of Petri Nets. Masson (1988)
Reisig, W.: Petri nets: An Introduction. In: EATCS Monographs in Computer Science. Springer, Heidelberg (1985)
Shepherdson, J.C., Sturgis, J.E.: Computability of recursive functions. Journal of the ACM 10, 217–255 (1963)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Busi, N., Zavattaro, G. (2005). Deciding Reachability in Mobile Ambients. In: Sagiv, M. (eds) Programming Languages and Systems. ESOP 2005. Lecture Notes in Computer Science, vol 3444. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31987-0_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-31987-0_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25435-5
Online ISBN: 978-3-540-31987-0
eBook Packages: Computer ScienceComputer Science (R0)