Figure 1
From: Inferring Boolean network states from partial information
A simple Boolean network. The network has three nodes, denoted as A, B, and C. Nodes A and B can change the Boolean value of node C, according to the rules given at the right side of the figure. Similarly, node C can change the value of node A. At the left side of the figure, a trajectory of length 3 is illustrated. In the initial state (T = 1), all the nodes receive a Boolean 1. According to the logical rule by which C changes the value of A, the value of A changes to 0 at time T = 2. At time point T = 3, the node C changes its value, since the input to the logical rule that determines its value has changed.