Undecidability of CA classification schemes
Complex Systems
Modern operating systems
Feynman and computation
Action, or the fungibility of computation
Feynman and computation
Handbook of graph grammars and computing by graph transformation: vol. 3: concurrency, parallelism, and distribution
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Introduction to Distributed Algorithms
Introduction to Distributed Algorithms
A Multi-Agent Cellular Automata System for Visualising Simulated Pedestrian Activity
Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry: Theoretical and Practical Issues on Cellular Automata
Programming agents with visual rules
VL '95 Proceedings of the 11th International IEEE Symposium on Visual Languages
Method of crowd simulation by using multiagent on cellular automata
IAT '03 Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology
Distributed Systems: Principles and Paradigms (2nd Edition)
Distributed Systems: Principles and Paradigms (2nd Edition)
Computer
Gathering asynchronous oblivious mobile robots in a ring
Theoretical Computer Science
Mobile agent algorithms versus message passing algorithms
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
A probabilistic model for distributed merging of mobile agents
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
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 of cellular automata and mobile agents, thus consequentially the fields of artificial life and multi agent systems, which have significant overlap but are still largely perceived as separate fields. In Chalopin et al. (Mobile agent algorithms versus message passing algorithms, pp. 187---201, 2006) the equivalent power of classical distributed algorithms and mobile agent algorithms was demonstrated for asynchronous systems with interleaving semantics under some further constraints and assumptions. Similar results are still being sought about mobile agent systems and distributed systems under other constraints and assumptions in search of a comprehensive general theory of these topics. This article investigates the relationship between mobile agent systems and a generalized form of cellular automata. With a particular notion of local equivalence, a cellular automaton can be translated into a mobile agent system and vice versa. The article shows that if the underlying network graph is finite, then the degree of pseudo-synchrony of the agent system simulating the cellular automaton can be made arbitrarily high, even with an only small number of active agents. As a possible consequence of this theoretical result, the Internet might be used in the future to implement large cellular automata of almost arbitrary topology.