Abstract
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribution, mobility, remote operations and asynchronous communication through distributed data spaces, the language provides constructs for explicitly modelling inter-node connections and for dynamically establishing and removing them. For the proposed language, we define natural notions of extensional observations and study their closure under operational reductions and/or language contexts to obtain barbed congruence and may testing equivalence. For such equivalences, we provide alternative characterizations in terms of a labelled bisimulation and a trace equivalence that can be used for actual proofs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amadio, R.M.: On modelling mobility. Theor. Comp. Sci. 240(1), 147–176 (2000)
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)
Boreale, M., De Nicola, R.: Testing equivalences for mobile processes. Information and Computation 120, 279–303 (1995)
Boreale, M., De Nicola, R., Pugliese, R.: Basic observables for processes. Information and Computation 149(1), 77–98 (1999)
Boreale, M., De Nicola, R., Pugliese, R.: Trace and testing equivalence on asynchronous processes. Information and Computation 172, 139–164 (2002)
Bugliesi, M., Crafa, S., Merro, M., Sassone, V.: Communication and Mobility Control in Boxed Ambients. To appear in Information and Computation
Cardelli, L., Gordon, A.D.: Mobile ambients. TCS 240(1), 177–213 (2000)
Castagna, G., Zappa Nardelli, F.: The Seal Calculus Revisited: contextual equivalence and bisimilarity. In: Agrawal, M., Seth, A.K. (eds.) FSTTCS 2002. LNCS, vol. 2556, pp. 85–96. Springer, Heidelberg (2002)
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. Tech. Rep. 07/2004, Dip. Informatica, Università di Roma “La Sapienza” (2004)
De Nicola, R., Gorla, D., Pugliese, R.: Global Computing in a Dynamic Network of Tuple Spaces. In: Jacquet, J.-M., Picco, G.P. (eds.) COORDINATION 2005. LNCS, vol. 3454, pp. 157–172. Springer, Heidelberg (2005)
De Nicola, R., Gorla, D., Pugliese, R.: On the Expressive Power of Klaim-based Calculi. In: Proc. of EXPRESS. ENTCS, vol. 128(2), pp. 117–130 (2004)
De Nicola, R., Hennessy, M.: Testing equivalence for processes. TCS 34, 83–133 (1984)
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)
Francalanza, A., Hennessy, M.: A Theory of System Behaviour in the Presence of Node and Link Failures. Tech. Rep. cs01:2005, Univ. of Sussex
Gelernter, D.: Generative communication in linda. TOPLAS 7(1), 80–112 (1985)
Hennessy, M., Merro, M., Rathke, J.: Towards a behavioural theory of access and mobility control in distributed systems. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol. 2620, pp. 282–299. Springer, Heidelberg (2003)
Honda, K., Yoshida, N.: On reduction-based process semantics. TCS 152(2) (1995)
Merro, M., Zappa Nardelli, F.: Bisimulation proof methods for mobile ambients. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 584–598. Springer, Heidelberg (2003)
Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 685–695. Springer, Heidelberg (1992)
Montanari, U., Pistore, M.: Finite state verification for the asynchronous pi-calculus. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 255–269. Springer, Heidelberg (1999)
Palamidessi, C.: Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculi. Mathematical Structures in Computer Science 13(5), 685–719 (2003)
Sangiorgi, D., Walker, D.: The π-calculus: a Theory of Mobile Processes. Cambridge University Press, Cambridge (2001)
Schmitt, A., Stefani, J.-B.: The m-calculus: a higher-order distributed process calculus. SIGPLAN Not. 38(1), 50–61 (2003)
Sewell, P.: From Rewrite Rules to Bisimulation Congruences. In: Sangiorgi, D., de Simone, R. (eds.) CONCUR 1998. LNCS, vol. 1466, pp. 269–284. Springer, Heidelberg (1998)
Sewell, P., Wojciechowski, P., Pierce, B.: Location independence for mobile agents. In: Bal, H.E., Cardelli, L., Belkhouche, B. (eds.) ICCL-WS 1998. LNCS, vol. 1686, p. 1. Springer, Heidelberg (1999)
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). Basic Observables for a Calculus for Global Computing. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds) Automata, Languages and Programming. ICALP 2005. Lecture Notes in Computer Science, vol 3580. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11523468_99
Download citation
DOI: https://doi.org/10.1007/11523468_99
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27580-0
Online ISBN: 978-3-540-31691-6
eBook Packages: Computer ScienceComputer Science (R0)