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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
