Welcome to the InfoSci Platform
Reference Hub4
Cellular Automata Communication Models: Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules

Cellular Automata Communication Models: Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules

Predrag T. Tošic
Copyright: © 2010 |Volume: 1 |Issue: 3 |Pages: 19
ISSN: 1947-928X|EISSN: 1947-9298|EISBN13: 9781609609818|DOI: 10.4018/jncr.2010070105
Cite Article Cite Article

MLA

Tošic, Predrag T. "Cellular Automata Communication Models: Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules." IJNCR vol.1, no.3 2010: pp.66-84. http://doi.org/10.4018/jncr.2010070105

APA

Tošic, P. T. (2010). Cellular Automata Communication Models: Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules. International Journal of Natural Computing Research (IJNCR), 1(3), 66-84. http://doi.org/10.4018/jncr.2010070105

Chicago

Tošic, Predrag T. "Cellular Automata Communication Models: Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules," International Journal of Natural Computing Research (IJNCR) 1, no.3: 66-84. http://doi.org/10.4018/jncr.2010070105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In this paper, cellular automata (CA) are viewed as an abstract model for distributed computing. The author argues that the classical CA model must be modified in several important respects to become a relevant model for large-scale MAS. The paper first proposes sequential cellular automata (SCA) and formalizes deterministic and nondeterministic versions of SCA. The author then analyzes differences in possible dynamics between classical parallel CA and various SCA models. The analysis in this paper focuses on one-dimensional parallel and sequential CA with node update rules restricted to simple threshold functions, as arguably the simplest totalistic, yet non-linear (and non-affine) update rules. The author identifies properties of asymptotic dynamics that can be proven to be entirely due to the assumption of perfect synchrony in classical, parallel CA. Finally, the paper discusses what an appropriate CA-based abstraction would be for large-scale distributed computing, insofar as the inter-agent communication models. In that context, the author proposes genuinely asynchronous CA and discusses main differences between genuinely asynchronous CA and various weakly asynchronous sequential CA models found in the literature.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.