A Distributed Computational Model for Mobile Agents

Authors:
Med Amine Haddar;Ahmed Hadj Kacem;Yves Métivier;Mohamed Mosbah;Mohamed Jmaiel
Affiliations:
ReDCAD Research Unit, École Nationale d'Ingénieurs de Sfax, Tunisie and LaBRI UMR 5800 ENSEIRB, Université Bordeaux 1, Talence, France 33405;MIRACL Laboratory, Faculté des Sciences Economiques et de Gestion de Sfax, Tunisie;LaBRI UMR 5800 ENSEIRB, Université Bordeaux 1, Talence, France 33405;LaBRI UMR 5800 ENSEIRB, Université Bordeaux 1, Talence, France 33405;ReDCAD Research Unit, École Nationale d'Ingénieurs de Sfax, Tunisie
Venue:
Agent Computing and Multi-Agent Systems
Year:
2009

Citing 5
Cited 1

Mobile ambients

Theoretical Computer Science
Mobile Agents - The Right Vehicle for Distributed Sequential Computing

HiPC '02 Proceedings of the 9th International Conference on High Performance Computing
Agents, Distributed Algorithms, and Stabilization

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Proving distributed algorithms for mobile agents: examples of spanning tree computation in anonymous networks

ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Mobile agent algorithms versus message passing algorithms

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems

A cloud and agent based architecture design for an educational mobile SNS game

Edutainment'11 Proceedings of the 6th international conference on E-learning and games, edutainment technologies

Quantified Score

Hi-index	0.00

Visualization

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.