Mobile agent systems and cellular automata

摘要: The purpose of this article (based on an earlier draft available as technical report: Gruner S, Mobile agent systems and cellular automata. LaBRI Research Reports, 2006) is to make a step towards uniting the paradigms automata mobile agents, thus consequentially fields artificial life multi systems, which have significant overlap but are still largely perceived separate fields. In Chalopin et al. (Mobile algorithms versus message passing algorithms, pp. 187---201, equivalent power classical distributed was demonstrated for asynchronous with interleaving semantics under some further constraints assumptions. Similar results being sought about other assumptions in search comprehensive general theory these topics. This investigates relationship between generalized form With particular notion local equivalence, automaton can be translated into system vice versa. shows that if underlying network graph finite, then degree pseudo-synchrony simulating made arbitrarily high, even only small number active agents. As possible consequence theoretical result, Internet might used future implement large almost arbitrary topology.