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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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)
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)
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)
Cardelli, L., Gordon, A.D.: Mobile ambients. Theor. Comput. Sci. 240(1), 177–213 (2000)
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)
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)
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)
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)
Haddar, M.A., Kacem, A.H., Mosbah, M., Métivier, Y., Jmaiel, M.: Distributed algorithms for mobile agents. Technical report, Université Bordeaux1 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haddar, M.A., Hadj Kacem, A., Métivier, Y., Mosbah, M., Jmaiel, M. (2009). A Distributed Computational Model for Mobile Agents. In: Ghose, A., Governatori, G., Sadananda, R. (eds) Agent Computing and Multi-Agent Systems. PRIMA 2007. Lecture Notes in Computer Science(), vol 5044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01639-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-01639-4_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01638-7
Online ISBN: 978-3-642-01639-4
eBook Packages: Computer ScienceComputer Science (R0)