Using Synchronous Boolean Networks to Model Several Phenomena of Collective Behavior
Figure 1
An example of a Kauffman network and its State Transition Graph.
The left part shows a simple Kauffman network with 3 vertices. Weight functions are specified by Boolean formulas in the right upper part of the figure. The lower right part demonstrates the state transition graph (STG) for the discrete function specified by this network. It contains one cycle of length 2 and one fixed point.