IDEAS home Printed from https://ideas.repec.org/a/igg/jncr00/v1y2010i3p66-84.html
   My bibliography  Save this article

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

Author

Listed:
  • Predrag T. Tošic

    (University of Houston, USA)

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.

Suggested Citation

  • Predrag T. Tošic, 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), IGI Global, vol. 1(3), pages 66-84, July.
  • Handle: RePEc:igg:jncr00:v:1:y:2010:i:3:p:66-84
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jncr.2010070105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jncr00:v:1:y:2010:i:3:p:66-84. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.