Abstract
Mobile agents are a well-known paradigm for the design and implementation of distributed systems. However, whilst their popularity continues to grow, a uniform theory of mobile agent systems is not yet sufficiently elaborated, in comparison with classical models of distributed computation. In this paper we show how to use mobile agents as an alternative model for implementing distributed local computation rules. In doing so, we approach a general and unified framework for local computations which is consistent with the classical theory of distributed computations based on graph relabeling systems.
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
Angluin, D.: Local and global properties in networks of processors. In: 12th Symposium on theory of computing, pp. 82–93 (1980)
Bauderon, M., Métivier, Y., Mosbah, M., Sellami, A.: From local computations to asynchronous message passing systems. Technical Report, LaBRI, RR-1271-02 (2002)
Bauderon, M., Mosbah, M.: A unified framework for designing, implementing and visualizing distributed algorithms. In: Bottoni, P., Minas, M. (eds.) Graph Transformation and Visual Modeling Techniques (GT-VMT 2002), Barcelona, Spain. Electronic Notes in Theoretical Computer Science, vol. 72 (2003)
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)
Chalopin, J., Paulusma, D.: Graph labelings derived from models in distributed computing. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol. 4271, pp. 301–312. Springer, Heidelberg (2006)
Gruner, S.: Mobile agent systems and cellular automata. Technical Report 1400-06, LaBRI - University of Bordeaux 1 (2006)
Hibaoui, A.E., Métivier, Y., Robson, J., Saheb-Djahromi, N., Zemmari, A.: Analysis of a randomized dynamic timetable handshake algorithm. Technical Report 1402-06, LaBRI (2006)
Knirsch, P., Kreowski, H.-J.: A note on modeling agent systems by graph transformation. In: Münch, M., Nagl, M. (eds.) AGTIVE 1999. LNCS, vol. 1779, pp. 79–86. Springer, Heidelberg (2000)
Litovsky, I., Métivier, Y., Sopena, E.: Different local controls for graph relabelling systems. Math. Syst. Theory 28, 41–65 (1995)
Litovsky, I., Métivier, Y., Sopena, E.: Graph relabelling systems and distributed algorithms. In: Ehrig, H., Kreowski, H.J., Montanari, U., Rozenberg, G. (eds.) Handbook of graph grammars and computing by graph transformation, vol. 3, pp. 1–56. World Scientific, Singapore (1999)
Litovsky, I., Métivier, Y., Zielonka, W.: On the Recognition of Families of Graphs with Local Computations. Inf. and Comp. 118(1), 110–119 (1995)
Métivier, Y., Saheb, N., Zemmari, A.: Randomized rendez vous. In: Mathematics and computer science: Algorithms, trees, combinatorics and probabilities, Trends in mathematics, pp. 183–194. Birkhäuser, Basel (2000)
Métivier, Y., Saheb, N., Zemmari, A.: Randomized local elections. Information Processing Letters 82, 313–320 (2002)
Métivier, Y., Saheb, N., Zemmari, A.: Analysis of a randomized rendez vous algorithm. Information and Computation 184, 109–128 (2003)
Ossamy, R.: An algorithmic and computational approach to local computations. In: Ph. D Thesis. LaBRI, University of Boredaux 1, France (December 2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Derbel, B., Mosbah, M., Gruner, S. (2008). Mobile Agents Implementing Local Computations in Graphs. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds) Graph Transformations. ICGT 2008. Lecture Notes in Computer Science, vol 5214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87405-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-87405-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87404-1
Online ISBN: 978-3-540-87405-8
eBook Packages: Computer ScienceComputer Science (R0)