Table 2.
Boolean Realizations of Motif 1A(i)
| C1 C2 | A | B | C | D | |
|---|---|---|---|---|---|
| B1 B2 | B1 B2 | B1 B2 | B1 B2 | ||
| Row 1 | 1 1 1 0 0 1 0 0 |
0 0 1 0 0 1 1 1 |
1 0 with prob p 0 1 with prob 1 − p 1 0 0 1 1 0 with prob q 0 1 with prob 1 − q |
1 0 1 0 0 1 0 1 |
0 1 1 0 0 1 0 1 |
| Row 2 | State Space | ![]() |
![]() |
![]() |
![]() |
| Asymptotic state | Probability of asymptotic states* | ||||
| Row 3 | Steady state (1,0) Steady state (0,1) Oscillation (00↔11) |
0.25 0.25 0.5 |
0.25+0.25(p+q) 0.75−0.25(p+q) 0 |
0.5 0.5 0 |
0.25 0.75 0 |
The four different versions of motif 1A(i) make different predictions about the probability that the system will end up in a particular asymptotic state given that the system is started from an ensemble of initial conditions uniformly distributed over the four possible states of the system {(0,0), (1,0), (0,1), (1,1)}.



