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.
|Name||Lecture Notes in Computer Science|
|Conference||12th International Conference on Cellular Automata for Research and Industry|
|Abbreviated title||ACRI 2016|
|Period||5/09/16 → 8/09/16|