Illustration of network damage and the methodology to repair a steady state. (a) A four-node network with logical update rules. The corresponding state transition networks under synchronous and random order asynchronous dynamics are shown in panels (b) and (c), respectively. Node labels indicate the state of each node in alphabetic order. Panels (d-f) show the same information for the network damaged such that node C is always OFF (0). The network states where node C is ON (1) are shown in panels (e-f) for completeness, but because they are no longer accessible to the network, they are shown in faded gray. Panels (g-i) show one repair methodology that ensures that the state 1101, where all nodes aside from node C are ON (1), is a steady state of the network.