Related Experiment Video
Updated: Jun 21, 2025

Designing and Implementing Nervous System Simulations on LEGO Robots
Published on: May 25, 2013
Dynamics of synchronous Boolean networks with non-binary states
Juan A Aledo1, Jose P Llano1, Jose C Valverde1
1Department of Mathematics, University of Castilla-La Mancha, Albacete 02071, Spain.
Abstract:
In this paper, we study the dynamics of synchronous Boolean networks and extend previously obtained results for binary Boolean networks to networks with state variables in a general Boolean algebra of 2p elements, with p>1. The method to do this is based on the Stone representation theorem and the relation of such systems on general Boolean algebras with those with binary-state values. Specifically, we deal with the main periodic orbit problems and predecessor problems (existence, coexistence, uniqueness, and number of them), which allows us to determine the periodic structure and the attractor cycles of the system. These results open opportunities to explore novel applications by means of such general systems.
More Related Videos
Related Concept Videos
Simplified Synchronous Machine Model
In this model, each generator is connected to a...
Relation between Mathematical Equations and Block Diagrams
Network Function of a Circuit
State Space Representation
Consider an RLC circuit, a...
BIBO stability of continuous and discrete -time systems
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
State Space to Transfer Function
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:

