Figure 1: Topology of an example RBN with N = 5, K = 2. Each node has two inputs that determine its state. Since the topology is randomly generated, a node might have several outputs or none at all. Table 1: Example lookup table to update a node z depending on the state of nodes x and y . Lookup tables include all possible combinations of inputs, i.e. 2 K rows. Different nodes will have different lookup tables, i.e. Boolean functions. In this example table, the function is the binary XNOR. 3 x(t) y(t) z(t+1) 0 0 1 0 1 0 1 0 0 1 1 1