Maxmin-ω: a simple deterministic asynchronous cellular automaton scheme

Ebrahim Patel

Research output: Chapter in Book/Report/Conference proceedingConference contribution

229 Downloads (Pure)

Abstract

In this paper, we introduce the maxmin-ω system, a simple and intuitive model of asynchronous dynamics on a network. Each node in this system updates its state upon receiving a fixed proportion ω of inputs from neighbourhood nodes. We study the behaviour of nodal update times as a function of ω. Computational results suggest most complexity when ω is approximately 0.5. By implementing a cellular automaton (CA) under this maxmin-ω asynchronous scheme, we show some correspondence in complexity between timing and CA output. Moreover, our system can be interpreted by the useful modelling tool of max-min-plus algebra (MMP). We propose that the aforementioned results on complexity can be derived analytically via MMP.
Original languageEnglish
Title of host publicationCellular Automata
Subtitle of host publication12th International Conference on Cellular Automata for Research and Industry, ACRI 2016, Fez, Morocco, September 5-8, 2016. Proceedings
EditorsSamira El Yacoubi, Jaroslaw Wąs, Stefania Bandini
PublisherSpringer
Pages192-198
Number of pages7
ISBN (Electronic)978-3-319-44365-2
ISBN (Print)978-3-319-44364-5
DOIs
Publication statusPublished - 5 Sep 2016
Event12th International Conference on Cellular Automata for Research and Industry - Fez, Morocco
Duration: 5 Sep 20168 Sep 2016

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume9863
ISSN (Print)0302-9743

Conference

Conference12th International Conference on Cellular Automata for Research and Industry
Abbreviated titleACRI 2016
Country/TerritoryMorocco
CityFez
Period5/09/168/09/16

Fingerprint

Dive into the research topics of 'Maxmin-ω: a simple deterministic asynchronous cellular automaton scheme'. Together they form a unique fingerprint.

Cite this