A Distributed Computational Model for Mobile Agents

  • Med Amine Haddar
  • Ahmed Hadj Kacem
  • Yves Métivier
  • Mohamed Mosbah
  • Mohamed Jmaiel
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5044)

Abstract

In this paper, a novel formalized mobile agent distributed computation model based on transition systems is presented. In our model, the mobile agent actions (e.g. computations, communication and migration) are described using transitions. Thus, a mobile agent algorithm is viewed as a transition system and the underlying distributed system is modeled by a connected graph. We exploit the high-level encoding of agent actions by transitions to prove the correctness of agent algorithms. We illustrate this approach with the distributed computation of a spanning tree.

Keywords

mobile agent computations model distributed algorithms transition systems 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Litovsky, I., Métivier, Y., Sopena, E.: Handbook of graph grammars and computing by graph transformation, vol. 3, pp. 1–56. World Scientific, Singapore (1999)CrossRefGoogle Scholar
  2. 2.
    Abbas, S., Mosbah, M., Zemmari, A.: Distributed computation of a spanning tree in a dynamic graph by mobile agents. In: IEEE International Conference on Engineering of Intelligent Systems, pp. 425–430 (2006)Google Scholar
  3. 3.
    Pan, L., Bic, L., Dillencourt, M.B., Lai, M.K.: Mobile agents - the right vehicle for distributed sequential computing. In: Sahni, S.K., Prasanna, V.K., Shukla, U. (eds.) HiPC 2002. LNCS, vol. 2552, pp. 575–584. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Cardelli, L., Gordon, A.D.: Mobile ambients. Theor. Comput. Sci. 240(1), 177–213 (2000)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Ghosh, S.: Agents, distributed algorithms, and stabilization. In: Du, D.-Z., Eades, P., Sharma, A.K., Lin, X., Estivill-Castro, V. (eds.) COCOON 2000. LNCS, vol. 1858, pp. 242–251. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  6. 6.
    Chalopin, J., Godard, E., Métivier, Y., Ossamy, R.: Mobile agent algorithms versus message passing algorithms. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol. 4305, pp. 187–201. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Haddar, M.A., Kacem, A.H., Métivier, Y., Mosbah, M., Jmaiel, M.: Proving distributed algorithms for mobile agents: Examples of spanning tree computation in anonymous networks. In: Rao, S., Chatterjee, M., Jayanti, P., Murthy, C.S.R., Saha, S.K. (eds.) ICDCN 2008. LNCS, vol. 4904, pp. 286–291. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  8. 8.
    Bauderon, M., Gruner, S., Metivier, Y., Mosbah, M., Sellami, A.: Visualization of distributed algorithms based on graph relabelling systems. Electronic Notes in Theoretical Computer Science 50(3), 227–237 (2001)CrossRefMATHGoogle Scholar
  9. 9.
    Haddar, M.A., Kacem, A.H., Mosbah, M., Métivier, Y., Jmaiel, M.: Distributed algorithms for mobile agents. Technical report, Université Bordeaux1 (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Med Amine Haddar
    • 1
    • 3
  • Ahmed Hadj Kacem
    • 2
  • Yves Métivier
    • 3
  • Mohamed Mosbah
    • 3
  • Mohamed Jmaiel
    • 1
  1. 1.ReDCAD Research UnitÉcole Nationale d’Ingénieurs de SfaxTunisie
  2. 2.MIRACL LaboratoryFaculté des Sciences Economiques et de Gestion de SfaxTunisie
  3. 3.LaBRI UMR 5800 ENSEIRBUniversité Bordeaux 1TalenceFrance

Personalised recommendations