A Distributed Computational Model for Mobile Agents
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.
Keywordsmobile agent computations model distributed algorithms transition systems
Unable to display preview. Download preview PDF.
- 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
- 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
- 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