a the I3-FFL network and (b) its associated Boolean logic for nodes activities; f1,2,3(x) are the Boolean functions used to compute the next value of each node from a given configuration x of the network, which is here a binary vector specifying the current value of each node, xi referring to the Boolean value of node i. Whereas theoretical and experimental studies showed that starting from all nodes being inactive, an activation of the output is possible when the signal is turned on (c), BN analysis cannot predict this transient behavior: (d) shows the corresponding complete dynamics of f starting from the configuration where all nodes are inactive, and signal is set to 1. Configurations are represented by piles of three squares, where the top square represents the state of the first component, and so forth. A white square represents the inactive (0) state; a blue square represents the active (1) state; a dashed line indicates that no further evolution is possible. Arrows indicate possible transitions. The node 3 is never predicted to be active.