Fig. 2

(a) The asynchronous state-transition graph of the network in Example 2. The two dotted edges are only present when \(\mathtt {K} = 0\). Consequently, the attractor of the network changes to the single highlighted state when \(\mathtt {K} = 1\). (b) Regulatory graph and parametrised update functions of the Boolean network in Example 2. Compared to Example 1, there is one new regulation, which may not be essential (thus uses a dashed arrow)