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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Derbel, B., Mosbah, M., & Gruner, S. (2008). Mobile agents implementing local computations in graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5214 LNCS, pp. 99–114). https://doi.org/10.1007/978-3-540-87405-8_8
Mendeley helps you to discover research relevant for your work.