Abstract
In our former work we have given a high-level formal model of a cloud service architecture in terms of a novel formal method approach which combines the advantages of the mathematically well-founded software engineering method called abstract state machines and of the calculus of mobile agents called ambient calculus. This paper presents an extension for this cloud model which enables client-to-client interaction in an almost direct way, so that the involvement of cloud services is transparent to the users. The discussed solution for transparent use of services is a kind of switching service, where registered cloud users communicate with each other, and the only role the cloud plays is to switch resources from one client to another. We also show in an example at the end of this paper how our novel client-to-client interaction mechanism can be utilized for the development of the anonymously accessible cloud services.
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
Similar content being viewed by others
Notes
- 1.
For an algebraic formalization of plots Kleene algebras with tests (KATs) [7] has been applied.
- 2.
In ambient calculus the capability Open \(n\).\(P\) is usually used to encode locks [3]. Such a lock can be released with an ambient like \(n\)[\(Q\)] whose name corresponds with the target ambient of the Open capability.
- 3.
- 4.
Service plots can accept requests if they are encompassed by ambients whose names are correspond with the unique names of the requested operations (\(o_i\)...\(o_j\)), see the definition of \(requestPreprocessor\) above.
- 5.
This is the only way how an ASM agent can make changes in the ambient tree hierarchy contained by dynamic derived function \(curAmbProc\) [1].
- 6.
In our applied ambient ASM-based formal method, ASM agents can communicate with each other directly via shared functions if and only if they are sibling of each other [1].
References
Bósa, K.: Formal modeling of mobile computing systems based on ambient abstract state machines. In: Schewe, K.-D., Thalheim, B. (eds.) SDKB 2013. LNCS, vol. 7693, pp. 18–49. Springer, Heidelberg (2013)
Börger, E., Stark, R.F.: Abstract State Machines: A Method for High-Level System Design and Analysis. Springer, Secaucus (2003)
Cardelli, L., Gordon, A.D.: Mobile ambients. Theor. Comput. Sci. 240, 177–213 (2000)
Bósa, K.: An ambient ASM model for cloud architectures. Formal Aspects of Computing (2013, submitted)
Ma, H., Schewe, K.-D., Thalheim, B., Wang, Q.: Abstract state services. In: Song, I.-Y., et al. (eds.) ER Workshops 2008. LNCS, vol. 5232, pp. 406–415. Springer, Heidelberg (2008)
Ma, H., Schewe, K.D., Thalheim, B., Wang, Q.: A theory of data-intensive software services. Serv. Orient. Comput. Appl. 3, 263–283 (2009)
Kozen, D.: Kleene algebra with tests. Trans. Program. Lang. Syst. 19, 427–443 (1997)
Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: A theory of processes with localities. Formal Aspects Comput. 6, 165–200 (1994). doi:10.1007/BF01221098
Cardelli, L.: Mobility and security. In: Bauer, F.L., Steinbrüggen, R., (eds.) Proceedings of NATO Advanced Study Institute on Foundations of Secure Computation. Lecture Notes for Marktoberdorf Summer School 1999 (A Summary of Several Ambient Calculus Papers), pp. 3–37. IOS Press (1999)
Schewe, K.D., Thalheim, B.: Personalisation of web information systems - a term rewriting approach. Data Knowl. Eng. 62, 101–117 (2007)
Tanaka, Y.: Meme Media and Meme Market Architectures: Knowledge Media for Editing, Distributing, and Managing Intellectual Resources. Wiley, New York (2003)
Ma, H., Schewe, K.D., Thalheim, B., Wang, Q.: A formal model for the interoperability of service clouds. Serv. Orient. Comput. Appl. 6, 189–205 (2012)
Jarraya, Y., Eghtesadi, A., Debbabi, M., Zhang, Y., Pourzandi, M.: Cloud calculus: security verification in elastic cloud computing platform. In: Smari, W.W., Fox, G.C. (eds.) CTS, pp. 447–454. IEEE (2012)
Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Parts I. and II. Inf. Comput. 100, 1–77 (1992)
Börger, E., Cisternino, A., Gervasi, V.: Ambient abstract state machines with applications. J. CSS (Special Issue in Honor of Amir Pnueli) 78, 939–959 (2012)
Valente, M., Bigonha, R., Loureiro, A., Maia, M.: Abstractions for mobile computation in ASM. In: Graham, P., Maheswaran, M. (eds.) Proceedings of the International Conference on Internet Computing, IC 2000, Las Vegas, Nevada, USA, 26–29 June 2000, pp. 165–172. CSREA Press (2000)
Bósa, K.: A formal model of a cloud service architecture in terms of ambient ASM. Technical report, Christian Doppler Laboratory for Client-Centric Cloud Computing (CDCC), Johannes Kepler University Linz, Austria (2012)
Bósa, K.: An ambient ASM model for client-to-client interaction via cloud computing. In: Proceedings of the 8th International Conference on Software and Data Technologies (ICSOFT), Reykjavik, Iceland, pp. 459–470 (Best Paper Award). SciTePress (2013)
De Ryck, P., Decat, M., Desmet, L., Piessens, F., Joosen, W.: Security of web mashups: a survey. In: Aura, T., Järvinen, K., Nyberg, K. (eds.) NordSec 2010. LNCS, vol. 7127, pp. 223–238. Springer, Heidelberg (2012)
Acknowledgements
This research has been supported by the Christian Doppler Society.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bósa, K. (2014). An Ambient ASM Model of Client-to-Client Interaction via Cloud Computing and an Anonymously Accessible Docking Service. In: Cordeiro, J., van Sinderen, M. (eds) Software Technologies. ICSOFT 2013. Communications in Computer and Information Science, vol 457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-44920-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-662-44920-2_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-44919-6
Online ISBN: 978-3-662-44920-2
eBook Packages: Computer ScienceComputer Science (R0)