Classification (Update schemes)
Random
Boolean Networks can be classified according to their degree of
synchronicity and determinism of their updating scheme ([SP2]). This
section shortly describes the update modes that are supported in
the RBN Toolbox.
CRBN
 Classical Random Boolean Networks
This is
the "original" RBN update scheme proposed by Kauffman,
where at each disrete timestep all nodes in the network are
updated synchronously.
Updating scheme: synchronous, deterministic
ARBN
 Asynchronous Random Boolean Networks
In this
update mode at each timestep a single node is chosen at random
and updated.
Updating scheme: asynchronous, nondeterministic
DARBN
 Deterministic Asynchronous Random Boolean Networks
Each node now has two
parameters p and q, where p and q are positive integers including
zero and q<p. At each discrete timestep k, all nodes that
verify q = k mod p are updated. If several nodes get updated at
the same timestep, then the changes made in the network by
updating one node are taken into account during the updating
procedure of the next node (online actualisation).
Updating scheme: asynchronous, deterministic
GARBN
 Generalized Asynchronous Random Boolean Networks
In this mode, the
restriction of the ARBN updating scheme only one node is updated
at each timestep  is lifted and a random number of nodes are now updated at each timestep. If several nodes get updated at
the same timestep, then the changes made in the nodestates by
updating one node are not taken into account during
the updating procedure of the next node (offline actualisation).
Updating scheme: semisynchronous, nondeterministic
DGARBN
 Deterministic Generalized Asynchronous Random Boolean
Networks
This updating mode resembles
the DARBN mode, also having two parameters p and q (p,q positive
integers including zero and q<p) for each node. A node is
updated when the actual discrete timestep k verifies q = k mod p.
Contrary to the DARBN mode, if several nodes get updated at the
same timestep, the changes made by one update are not respected
during the update procedure of another node (offline
actualisation).
Updating scheme: semisynchronous, deterministic
