Skip to main content
[Preprint]. 2023 Sep 12:2023.09.11.557227. [Version 1] doi: 10.1101/2023.09.11.557227

Figure 1:

Figure 1:

Wiring diagram and state space of the Boolean network F=f1,f2,f3= x2¬x3,x3,¬x1x2. (a) The wiring diagram encodes the dependency between variables. Subnetworks are defined on the basis of the wiring diagram. For example, the subnetwork Fx2,x3x1,x2,x3=x3,¬x1x2 is the restriction of F to x2,x3 and contains external parameter x1. (b) The state space is a directed graph with edges between all states and their images. This graph therefore encodes all possible trajectories and attractors. Here, F has two steady states, 000 and 011, and one limit cycle, (010,101), so 𝒜(F)={000,011,(010,101)}.