Formal Modeling of Mobile Computing Systems Based on Ambient Abstract State Machines

  • Károly Bósa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7693)


In this paper, we present a high-level definition of a formal method in terms of ambient abstract state machine rules which makes it possible to describe formal models of mobile computing systems and complex service oriented architectures in two abstraction layers.

This means that while the algorithms and local interactions of executable components (agents) are specified in terms of abstract state machines; the long-term interactions as well as movements of various components via various administrative domains are given in terms of ambient calculus in our approach.


Open Task Cloud Service Cloud Resource Input Action Reduction Rule 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blass, A., Gurevich, Y.: Abstract State Machines Capture Parallel Algorithms: Correction and Extension, vol. 9, pp. 19:1–19:32. ACM, New York (2008),
  2. 2.
    Börger, E., Stark, R.F.: Abstract State Machines: A Method for High-Level System Design and Analysis. Springer-Verlag New York, Inc., Secaucus (2003)MATHGoogle Scholar
  3. 3.
    Börger, E., Cisternino, A., Gervasi, V.: Ambient Abstract State Machines with Applications. J.CSS (Special Issue in honor of Amir Pnueli) 78(3), 939–959 (2012), MATHGoogle Scholar
  4. 4.
    Börger, E., Schmid, J.: Composition and Submachine Concepts for Sequential ASMs. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 41–60. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  5. 5.
    Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: A Theory of Processes with Localities. Formal Aspects of Computing 6, 165–200 (1994),, doi:10.1007/BF01221098MATHCrossRefGoogle Scholar
  6. 6.
    Boudol, G., Castellani, I., Hennessy, M., Kiehn, A.: Observing Localities. In: Tarlecki, A. (ed.) MFCS 1991. LNCS, vol. 520, pp. 93–102. Springer, Heidelberg (1991)CrossRefGoogle Scholar
  7. 7.
    Cardelli, L.: Abstractions for Mobile Computation. In: Vitek, J., Jensen, C.D. (eds.) Secure Internet Programming. LNCS, vol. 1603, pp. 51–94. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  8. 8.
    Cardelli, L.: Mobility and Security. In: Bauer, F.L., Steinbrüggen, R. (eds.) Foundations of Secure Computation Proc. NATO Advanced Study Institute, pp. 3–37. IOS Press (1999); Lecture Notes for Marktoberdorf Summer School 1999 (A summary of several Ambient Calculus papers)Google Scholar
  9. 9.
    Cardelli, L., Gordon, A.D.: Mobile Ambients. Theor. Comput. Sci. 240(1), 177–213 (2000)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Castellani, I., Hennessy, M.: Distributed Bisimulations. J. ACM 36(4), 887–911 (1989)MathSciNetMATHCrossRefGoogle Scholar
  11. 11.
    Farahbod, R., Gervasi, V., Glässer, U.: CoreASM: An Extensible ASM Execution Engine. Fundam. Inf. 77, 71–103 (2007), MATHGoogle Scholar
  12. 12.
    Gordon, A.D., Cardelli, L.: Equational Properties of Mobile Ambients. Mathematical Structures in Comp. Sci. 13, 371–408 (2003), MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Gurevich, Y.: Evolving Algebra 1993: Lipari Guide. In: International Conference on Functional Programming, pp. 9–36. Oxford University Press (1994)Google Scholar
  14. 14.
    Gurevich, Y.: Sequential Abstract State Machines Capture Sequential Algorithms, vol. 1, pp. 77–111. ACM, New York (2000), Google Scholar
  15. 15.
    Kiehn, A.: Distributed Bisimulations for Finite CCS. Tech. Rep. 7/89, Computer Science, School of Cognitive and Computing Sciences, University of Sussex, Brighton BN1 9QH (December 1989)Google Scholar
  16. 16.
    Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)CrossRefGoogle Scholar
  17. 17.
    Milner, R.: Communication and Concurrency. PHI Series in computer science. Prentice Hall (1989)Google Scholar
  18. 18.
    Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, Parts I. and II. Information and Computation 100(1), 1–77 (1992), Scholar
  19. 19.
    de Oliveira Valente, M.T., da Silva Bigonha, R., Loureiro, A.A.F., de Almeida 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, June 26-29, pp. 165–172. CSREA Press (2000)Google Scholar
  20. 20.
    Pierce, B.C., Turner, D.N.: Pict: A Programming Language Based on the Pi-Calculus. In: Plotkin, G., Stirling, C., Tofte, M. (eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner, Foundations of Computing, pp. 455–494. MIT Press (May 2000)Google Scholar
  21. 21.
    Turner, D.N.: The Polymorphic Pi-calculus: Theory and Implementation. PhD thesis, LFCS (June 1996), CST-126-96 (also published as ECS-LFCS-96-345)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Károly Bósa
    • 1
  1. 1.Christian Doppler Laboratory for Client-Centric Cloud ComputingHagenberg im MühlkreisAustria

Personalised recommendations