{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T16:14:43Z","timestamp":1781108083509,"version":"3.54.1"},"reference-count":39,"publisher":"IGI Global Scientific Publishing","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,7,1]]},"abstract":"<p>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.<\/p>","DOI":"10.4018\/jncr.2010070105","type":"journal-article","created":{"date-parts":[[2011,2,15]],"date-time":"2011-02-15T16:00:29Z","timestamp":1297785629000},"page":"66-84","source":"Crossref","is-referenced-by-count":5,"title":["Cellular Automata Communication Models"],"prefix":"10.4018","volume":"1","author":[{"given":"Predrag T.","family":"To\u0161ic","sequence":"first","affiliation":[{"name":"University of Houston, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"issue":"1-2","key":"jncr.2010070105-0","article-title":"Computation by Asynchronously Updating Cellular Automata.","volume":"114","author":"S.Adachi","year":"2004","journal-title":"Journal of Statistical Physics"},{"key":"jncr.2010070105-1","author":"W. R.Ashby","year":"1960","journal-title":"Design for a Brain"},{"key":"jncr.2010070105-2","doi-asserted-by":"crossref","unstructured":"Barrett, C., Hunt, H., Marathe, M., Ravi, S. S., Rosenkrantz, D., Stearns, R., et al. (2001, July). Gardens of Eden and Fixed Points in Sequential Dynamical Systems. In Discrete Mathematics and Theoretical Computer Science (DMTCS): Proceedings of AA (DM-CCG).","DOI":"10.46298\/dmtcs.2294"},{"key":"jncr.2010070105-3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00395-X"},{"key":"jncr.2010070105-4","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(98)10114-5"},{"issue":"3","key":"jncr.2010070105-5","doi-asserted-by":"crossref","DOI":"10.1016\/S0096-3003(00)00042-4","article-title":"Elements of a theory of computer simulation III: equivalence of sequential dynamical systems.","volume":"122","author":"C.Barrett","year":"2001","journal-title":"Applied Mathematics and Computation"},{"key":"jncr.2010070105-6","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(97)10166-7"},{"key":"jncr.2010070105-7","unstructured":"Bersini, H., & Detours, V. (1994). Asynchrony induces stability in cellular automata based models. In R. Brooks, & P. Maes (Eds.), Artificial Life IV: Proceedings of the 4th International Workshop on Synthesis and Simulation of Living Systems. Cambridge, MA: MIT Press."},{"key":"jncr.2010070105-8","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1993.1052"},{"key":"jncr.2010070105-9","article-title":"Interleaving semantics and action refinement with atomic choice","author":"I.Czaja","year":"1992","journal-title":"Advances in Petri Nets (LNCS 609)"},{"key":"jncr.2010070105-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.05.036"},{"key":"jncr.2010070105-11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-77905-3","author":"M.Garzon","year":"1995","journal-title":"Models of Massive Parallelism: Analysis of Cellular Automata and Neural Networks"},{"key":"jncr.2010070105-12","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-0529-0","author":"E.Goles","year":"1990","journal-title":"Neural and Automata Networks: Dynamical Behavior and Applications. Alphen aan den Rijn"},{"key":"jncr.2010070105-13","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-015-9223-9","author":"E.Goles","year":"1999","journal-title":"Cellular Automata and Complex Systems. Alphen aan den Rijn"},{"key":"jncr.2010070105-14","author":"H.Gutowitz","year":"1991","journal-title":"Cellular Automata: Theory and Experiment"},{"key":"jncr.2010070105-15","author":"C. A. R.Hoare","year":"1985","journal-title":"Communicating Sequential Processes"},{"key":"jncr.2010070105-16","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(84)90249-5"},{"key":"jncr.2010070105-17","doi-asserted-by":"publisher","DOI":"10.1016\/0167-2789(84)90257-4"},{"key":"jncr.2010070105-18","author":"N. A.Lynch","year":"1996","journal-title":"Distributed Algorithms"},{"key":"jncr.2010070105-19","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","author":"R.Milner","year":"1980","journal-title":"A Calculus of Communicating Systems"},{"key":"jncr.2010070105-20","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(83)90114-7"},{"key":"jncr.2010070105-21","author":"R.Milner","year":"1989","journal-title":"Communication and Concurrency"},{"key":"jncr.2010070105-22","article-title":"Evolution in Asynchronous Cellular Automata","author":"C. L.Nehaniv","year":"2003","journal-title":"Artificial Life VIII"},{"key":"jncr.2010070105-23","first-page":"27","article-title":"On acyclic orientations and sequential dynamical systems.","volume":"\u25aa\u25aa\u25aa","author":"C.Reidys","year":"2001","journal-title":"Advances in Applied Mathematics"},{"key":"jncr.2010070105-24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626364"},{"key":"jncr.2010070105-25","author":"R.Sethi","year":"1996","journal-title":"Programming Languages: Concepts & Constructs"},{"key":"jncr.2010070105-26","unstructured":"Sutner, K. (1998). Computation theory of cellular automata. Paper presented at the MFCS-98 Satellite Workshop on CA, Brno, Czech Republic."},{"key":"jncr.2010070105-27","doi-asserted-by":"crossref","unstructured":"Tosic, P. (2004). A Perspective on the Future of Massively Parallel Computing: Fine-Grain vs. Coarse-Grain Parallel Models. In Proceedings of ACM Computing Frontiers (CF\u201904), Ischia, Italy.","DOI":"10.1145\/977091.977160"},{"key":"jncr.2010070105-28","doi-asserted-by":"crossref","unstructured":"Tosic, P. (2005). Cellular Automata for Distributed Computing: Models of Agent Interaction and Their Implications. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (SMC\u201905) (pp. 3204-3209).","DOI":"10.1109\/ICSMC.2005.1571639"},{"key":"jncr.2010070105-29","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054106004339"},{"key":"jncr.2010070105-30","unstructured":"Tosic, P., & Agha, G. (2004a, April). Concurrency vs. Sequential Interleavings in 1-D Threshold Cellular Automata. In Proceedings of the 18th IEEE International Parallel & Distributed Processing Symposium (IPDPS\u201904), Santa Fe, NM."},{"key":"jncr.2010070105-31","doi-asserted-by":"crossref","unstructured":"Tosic, P., & Agha, G. (2004b, October). Characterizing Configuration Spaces of Simple Threshold Cellular Automata. In Proceedings of the 6th International Conference on Cellular Automata for Research and Industry (ACRI\u201904), Amsterdam, The Netherlands (LNCS 3305, pp. 861-870).","DOI":"10.1007\/978-3-540-30479-1_89"},{"key":"jncr.2010070105-32","unstructured":"Tosic, P., & Agha, G. (2005). Parallel vs. Sequential Threshold Cellular Automata: Comparison and Contrast. In Proceedings of the First European Conference on Complex Systems (ECCS\u201905) (No. 251). Paris: European Complex Systems Society."},{"key":"jncr.2010070105-33","doi-asserted-by":"crossref","unstructured":"van Glabbek, R. J., & Goltz, U. (1990). Equivalences and refinement. In I. Guessarian (Ed.), Proceedings of LITP Spring School Theoretical Computer Science Conference, La Roche-Posay, France (LNCS 469).","DOI":"10.1007\/3-540-53479-2_13"},{"key":"jncr.2010070105-34","author":"J.von Neumann","year":"1966","journal-title":"Theory of Self-Reproducing Automata"},{"key":"jncr.2010070105-35","first-page":"9","article-title":"Twenty problems in the theory of CA.","volume":"\u25aa\u25aa\u25aa","author":"S.Wolfram","year":"1985","journal-title":"Physica Scripta"},{"key":"jncr.2010070105-36","author":"S.Wolfram","year":"1986","journal-title":"Theory and applications of CA"},{"key":"jncr.2010070105-37","author":"S.Wolfram","year":"1994","journal-title":"Cellular Automata and Complexity"},{"key":"jncr.2010070105-38","author":"S.Wolfram","year":"2002","journal-title":"A New Kind of Science"}],"container-title":["International Journal of Natural Computing Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=49126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:13:44Z","timestamp":1654110824000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jncr.2010070105"}},"subtitle":["Comparative Analysis of Parallel, Sequential and Asynchronous CA with Simple Threshold Update Rules"],"short-title":[],"issued":{"date-parts":[[2010,7,1]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jncr.2010070105","relation":{},"ISSN":["1947-928X","1947-9298"],"issn-type":[{"value":"1947-928X","type":"print"},{"value":"1947-9298","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,1]]}}}