In this paper we study a new class of generic, parametrized, locally load-sensing (LLS) network-routing protocols over simple graphs, Y. These protocols are Y-"local" in the sense that they transmit packets only between Y-adjacent vertices and LLS since they base their "routing decisions"...

We study asynchronous cellular automata (ACA) induced by symmetric Boolean functions [1]. These systems can be considered as sequential dynamical systems (SDS) over words, a class of dynamical systems that consists of (a) a finite, labeled graph Y with vertex set {v1,…,vn} and where each...

Discrete dynamical systems based on dependency graphs have played an important role in the mathematical theory of computer simulations. In this paper, we are concerned with parallel dynamical systems (PDS) and sequential dynamical systems (SDS) with the OR and NOR functions as local functions....