Abstract
We present a calculus inspired by Klaim whose main features are: explicit process distribution and node interconnections, remote operations, process mobility and asynchronous communication through distributed tuple spaces. We first introduce a basic language where connections are reliable and immutable; then, we enrich it with two more advanced features for global computing, i.e. failures and dynamically evolving connections. In each setting, we use our formalisms to specify some non-trivial global computing applications and exploit the semantic theory based on an observational equivalence to equationally establish properties of the considered case-studies.
This work has been partially supported by EU FET – Global Computing initiative project MIKADO IST-2001-32222. The funding bodies are not responsible for any use that might be made of the results presented here.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abadi, M., Gordon, A.D.: Reasoning about cryptographic protocols in the Spi calculus. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol. 1243, pp. 59–73. Springer, Heidelberg (1997)
Attiya, H., Welch, J.: Distributed Computing. McGraw-Hill, New York (1998)
Bettini, L., De Nicola, R., Ferrari, G., Pugliese, R.: Interactive Mobile Agents in X-Klaim. In: Proc. of the 7th WETICE, pp. 110–115. IEEE, Los Alamitos (1998)
Bettini, L., Loreti, M., Pugliese, R.: An Infrastructure Language for Open Nets. In: Proc. of the 2000 ACM Symposium on Applied Computing, pp. 373–377. ACM Press, New York (2002)
Cabri, G., Leonardi, L., Zambonelli, F.: Reactive Tuple Spaces for Mobile Agent Coordination. In: Rothermel, K., Hohl, F. (eds.) MA 1998. LNCS, vol. 1477, pp. 237–248. Springer, Heidelberg (1998)
Cardelli, L.: Abstractions for mobile computation. In: Vitek, J. (ed.) Secure Internet Programming. LNCS, vol. 1603, pp. 51–94. Springer, Heidelberg (1999)
Cardelli, L., Gordon, A.D.: Mobile ambients. Theoretical Computer Science 240(1), 177–213 (2000)
Castellani, S., Ciancarini, P., Rossi, D.: The ShaPE of ShaDE: a coordination system. Tech. Rep. UBLCS 96-5, Dip. di Scienze dell’Informazione, Univ. di Bologna, Italy (1996)
Chandra, T., Toueg, S.: Unreliable Failure Detectors for Reliable Distributed Systems. Journal of the ACM 43(2), 225–267 (1996)
Chaudhuri, S.: More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems. Information and Computation 105(1), 132–158 (1993)
Davies, N., Wade, S., Friday, A., Blair, G.: L2imbo: a tuple space based platform for adaptive mobile applications. In: Int. Conference on Open Distributed Processing/Distributed Platforms, ICODP/ICDP 1997 (1997)
De Nicola, R., Ferrari, G., Pugliese, R.: Klaim: a Kernel Language for Agents Interaction and Mobility. IEEE Transactions on Software Engineering 24(5), 315–330 (1998)
De Nicola, R., Gorla, D., Pugliese, R.: Basic observables for a calculus for global computing. Technical Report 07/2004, Dip. di Informatica, Univ. di Roma “La Sapienza”., Available at, http://www.dsi.uniroma1.it/~gorla/papers/bo4k-full.pdf
De Nicola, R., Hennessy, M.: Testing equivalence for processes. Theoretical Computer Science 34, 83–133 (1984)
Deugo, D.: Choosing a Mobile Agent Messaging Model. In: Proc. of ISADS 2001, pp. 278–286. IEEE, Los Alamitos (2001)
Fournet, C., Gonthier, G., Lévy, J.-J., Maranget, L., Rémy, D.: A calculus of mobile agents. In: Sassone, V., Montanari, U. (eds.) CONCUR 1996. LNCS, vol. 1119, pp. 406–421. Springer, Heidelberg (1996)
Fuzzati, R., Merro, M., Nestmann, U.: Modelling Consensus in a Process Calculus. In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 399–414. Springer, Heidelberg (2003)
Gelernter, D.: Generative communication in linda. ACM Transactions on Programming Languages and Systems 7(1), 80–112 (1985)
Gorla, D., Pugliese, R.: Resource Access and Mobility Control with Dynamic Privileges Acquisition. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 119–132. Springer, Heidelberg (2003)
Gorla, D., Pugliese, R.: Enforcing Security Policies via Types. In: Hutter, D., Müller, G., Stephan, W., Ullmann, M. (eds.) Security in Pervasive Computing. LNCS, vol. 2802, pp. 88–103. Springer, Heidelberg (2004)
Hennessy, M., Riely, J.: Resource Access Control in Systems of Mobile Agents. Information and Computation 173, 82–120 (2002)
Milner, R.: The polyadic π-calculus: A tutorial. In: Logic and Algebra of Specification. NATO ASI. Series F, vol. 94. Springer, Heidelberg (1993)
Omicini, A., Zambonelli, F.: Coordination of Mobile Information Agents in Tucson. Journal of Internet Research 8(5), 400–413 (1998)
Orava, F., Parrow, J.: An algebraic verification of a mobile network. Formal Aspects of Computing 4, 497–543 (1992)
Parrow, J.: An introduction to the pi-calculus. In: Handbook of Process Algebra, pp. 479–543. Elsevier Science, Amsterdam (2001)
Picco, G.P., Murphy, A.L., Roman, G.-C.: Lime: Linda Meets Mobility. In: Proc. of the 21 st Int. Conference on Software Engineering (ICSE 1999), pp. 368–377. IEEE, Los Alamitos (1999)
Unyapoth, A., Sewell, P.: Nomadic Pict: Correct Communication Infrastructures for Mobile Computation. In: Proc. of POPL 2001, pp. 116–127. ACM Press, New York (2001)
Victor, B., Moller, F.: The Mobility Workbench — a tool for the π-calculus. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 428–440. Springer, Heidelberg (1994)
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
De Nicola, R., Gorla, D., Pugliese, R. (2005). Global Computing in a Dynamic Network of Tuple Spaces. In: Jacquet, JM., Picco, G.P. (eds) Coordination Models and Languages. COORDINATION 2005. Lecture Notes in Computer Science, vol 3454. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11417019_11
Download citation
DOI: https://doi.org/10.1007/11417019_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25630-4
Online ISBN: 978-3-540-32006-7
eBook Packages: Computer ScienceComputer Science (R0)