@inproceedings{eba6939ce8da451c9b3646bc7a427dbe,
title = "Maxmin-ω: a simple deterministic asynchronous cellular automaton scheme",
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.",
author = "Ebrahim Patel",
year = "2016",
month = sep,
day = "5",
doi = "10.1007/978-3-319-44365-2_19",
language = "English",
isbn = "978-3-319-44364-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "192--198",
editor = "{El Yacoubi}, Samira and W{\c a}s, { Jaroslaw} and Stefania Bandini",
booktitle = "Cellular Automata",
note = "12th International Conference on Cellular Automata for Research and Industry, ACRI 2016 ; Conference date: 05-09-2016 Through 08-09-2016",
}