Abstract
Recently, there have been several studies focusing on the implementation of process calculi with distribution and mobility. Among these, Pan and GcPan are distributed abstract machines for executing Safe Ambients, a variant of the Ambient calculus. However, in order to use them or to exploit their implementation techniques, we must assume all-to-all and permanent connectivity in the underlying network; this is inappropriate for most real-world wide-area and mobile networks, in which each private network is delimited by network boundaries and each mobile device may become disconnected at any moment. In this paper, we propose novel abstract machines Pan mov , GcPan mov , and GcPan shift that can handle such network boundaries and mobile devices by using a special kind of agents called boundary forwarders. Especially in GcPan shift , operations related to boundary forwarders improve the fault tolerance of user programs. Finally, we prove the correctness of the proposed machines by using weak barbed bisimulation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cardelli, L.: Mobile Ambient Synchronization. Technical Report 1997-013, Digital Systems Research (1997)
Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140–155. Springer, Heidelberg (1998)
Fournet, C.: The Join-Calculus: a Calculus for Distributed Mobile Programming. PhD thesis, Ecole Polytechnique (1998)
Fournet, C., Lévy, J.J., Schmitt, A.: An Asynchronous, Distributed Implementation of Mobile Ambients. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872, pp. 348–364. Springer, Heidelberg (2000)
GcPan webpage, http://perso.ens-lyon.fr/damien.pous/gcpan
GcPan shift webpage, http://ryujin.kuis.kyoto-u.ac.jp/~umatani/pan/
Giannini, P., Sangiorgi, D., Valente, A.: Safe Ambients: Abstract Machine and Distributed Implementation. Science of Computer Programming 59, 209–249 (2006)
Hirschkoff, D., Pous, D., Sangiorgi, D.: A Correct Abstract Machine for Safe Ambients. In: Jacquet, J.-M., Picco, G.P. (eds.) COORDINATION 2005. LNCS, vol. 3454, pp. 17–32. Springer, Heidelberg (2005)
Hirschkoff, D., Pous, D., Sangiorgi, D.: An efficient abstract machine for Safe Ambients. Journal of Logic and Algebraic Programming 71(2), 114–149 (2007)
Levi, F., Sangiorgi, D.: Mobile Safe Ambients. ACM Transactions on Programming Languages and Systems 25, 1–69 (2003)
Phillips, A., Yoshida, N., Eisenbach, S.: A Distributed Abstract Machine for Boxed Ambient Calculi. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol. 2986, pp. 155–170. Springer, Heidelberg (2004)
Sangiorgi, D., Valente, A.: A Distributed Abstract Machine for Safe Ambients. In: Yu, Y., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 408–420. Springer, Heidelberg (2001)
Schmitt, A., Stefani, J.: An Abstract Machine for the Kell Calculus. In: Steffen, M., Tennenholtz, M. (eds.) FMOODS 2005. LNCS, vol. 3535, pp. 31–46. Springer, Heidelberg (2005)
Tarjan, R.E.: Efficiency of a Good But Not Linear Set Union Algorithm. Journal of the ACM 22, 215–225 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 IFIP International Federation for Information Processing
About this paper
Cite this paper
Umatani, S., Yasugi, M., Yuasa, T. (2011). Abstract Machines for Safe Ambients in Wide-Area and Mobile Networks. In: De Meuter, W., Roman, GC. (eds) Coordination Models and Languages. COORDINATION 2011. Lecture Notes in Computer Science, vol 6721. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21464-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-21464-6_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21463-9
Online ISBN: 978-3-642-21464-6
eBook Packages: Computer ScienceComputer Science (R0)