相关论文: A Criterion for Stability in Random Boolean Cellul…

Random Boolean networks, originally invented as models of genetic regulatory networks, are simple models for a broad class of complex systems that show rich dynamical structures. From a biological perspective, the most interesting networks…

Generation of pseudo random sequences by cellular automata, as well as by hybrid cellular automata is surveyed. An application to the fast evaluation and FPGA implementation of some classes of boolean functions is sketched out.

Controllability is one of the central concepts of modern control theory that allows a good understanding of a system's behaviour. It consists in constraining a system to reach the desired state from an initial state within a given time…

Functional verification constitutes one of the most challenging tasks in the development of modern hardware systems, and simulation-based verification techniques dominate the functional verification landscape. A dominant paradigm in…

Despite their apparent simplicity, random Boolean networks display a rich variety of dynamical behaviors. Much work has been focused on the properties and abundance of attractors. We here derive an expression for the number of attractors in…

A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law.

Steady state multiplicity can occur in nonlinear systems, and this presents challenges to feedback control. Input multiplicity arises when the same steady state output values can be reached with system inputs at different values. Dynamic…

Boolean networks, widely used to model gene regulation, exhibit a phase transition between regimes in which small perturbations either die out or grow exponentially. We show and numerically verify that this phase transition in the dynamics…

Gradual advancement of control technology gives rise to the studies of the stability of linear systems. The stability of the linear multiagent system is motivated by increasing utilization of agent dynamics together with the number of…

A simple one-dimensional cellular automaton model with threshold dynamics is introduced. The cumulative distribution of the size of the relaxations is analytically computed and behaves as a power law with an exponent equal to -1. This…

Three reasonable hypotheses lead to the thesis that physical phenomena can be described and simulated with cellular automata. In this work, we attempt to describe the motion of a particle upon which a constant force is applied, with a…

We study a variant of the classical membership problem in automata theory, which consists of deciding whether a given input word is accepted by a given automaton. We do so under a different perspective, that is, we consider a dynamic…

We study cellular automata where the state at each site is decided by a majority vote of the sites in its neighborhood. These are equivalent, for a restricted set of initial conditions, to non-zero probability transitions in single…

Motivated by studies of typical properties of quantum states in statistical mechanics, we introduce phase-random states, an ensemble of pure states with fixed amplitudes and uniformly distributed phases in a fixed basis. We first show that…

A cellular automaton model is presented for random walkers with biologically motivated interactions favoring local alignment and leading to collective motion or swarming behavior. The degree of alignment is controlled by a sensitivity…

Slotted Aloha has been widely adopted in various communication networks. Yet if the transmission probabilities and traffic input rates of transmitters are not properly regulated, their data queues may easily become unstable. For stability…

Inspired by the local minority game, we propose a network Boolean game and investigate its dynamical properties on scale-free networks. The system can self-organize to a stable state with better performance than random choice game, although…

We discovered that certain patterns called injective patterns remain stable during the revolution process, allowing us to create many reversible CA simply by using them to design the revolution rules. By examining injective patterns, we…

We investigate the effect of noise on Random Boolean Networks. Noise is implemented as a probability $p$ that a node does not obey its deterministic update rule. We define two order parameters, the long-time average of the Hamming distance…

We investigate a soliton cellular automaton (Box-Ball system) with periodic boundary conditions. Since the cellular automaton is a deterministic dynamical system that takes only a finite number of states, it will exhibit periodic motion. We…