A Finite State Mobile Agent Computation Model

In this paper, a novel formalized finite state mobile agent computation model based on the virtual organization is presented. In this model, all the actions (e.g. service, migration and communication etc.) of the mobile agents are treated as states. The process of the mobile agents' workflow is controlled by a finite-state-machine. This ensures the atomic action for each mobile agent to avoid the abnormal condition of communication mismatch, which is very common in the traditional mobile agent systems.

[1]  Ian T. Foster,et al.  The Anatomy of the Grid: Enabling Scalable Virtual Organizations , 2001, Int. J. High Perform. Comput. Appl..

[2]  Robert S. Gray,et al.  Agent Tcl: A transportable agent system , 1995, CIKM Information Agents Workshop.

[3]  Danny B. Lange,et al.  Programming Mobile Agents in Java with the Java Aglet API , 1997 .

[4]  Tao Xian Communication Mechanism in Mogent System , 2000 .

[5]  Wu Zhaohui,et al.  Virtual and Dynamic Hierarchical Architecture for E-Science Grid , 2003 .

[6]  Zhaohui Wu,et al.  Virtual and Dynamic Hierarchical Architecture for E-science Grid , 2003, International Conference on Computational Science.

[7]  Amy L. Murphy,et al.  Reliable Communication for Highly Mobile Agents , 2004, Autonomous Agents and Multi-Agent Systems.