Fig. 3From: Exploring attractor bifurcations in Boolean networks(a) Regulation graph of the network in Example 3. (b) Overview of the bifurcation function in Example 3 as computed by AEON. (c) A bifurcation decision tree constructed in AEON with four possible behavioural classes (\([\odot ], [\circlearrowleft ], [\rightleftarrows ]\), and \([\odot , \odot ]\)) for the network in Example 3. Solid and dashed arrows represent positive and negative decisions, respectivelyBack to article page