Figure 2.

(A) The interaction graph of an example network where each f_i is the disjunction of its inputs (e.g., f ₆ = v₅ + v₄) except for v₁ which is inhibited by v₂ ( $f_1:=\overline{v_2}$). (B) The condensation graph (Z, ▹) with the unique top layer node {v₁ v₂}. (C) The corresponding minimal autonomous set W. The restriction (W, F_|W) is trap-space-free. (D) To extend W, we compute the graph (Z′, ▹), which is obtained from (Z, ▹) by removing the node that intersects W. The new top layer node is Y  : = {v₅, v₆}. (E) The extended autonomous set W ′ is obtained by considering Above(Y) in the interaction graph. It has a minimal trap space p that is defined by fixing v₅ and v₆ to 1.