Analytical approach of synchronous and asynchronous update schemes applied to solving biological Boolean networks

Characterizing the minimum, necessary and sufficient components to generate the dynamics of a biological system has always been a priority to understand its functioning. In this sense, the canonical form of biological systems modeled by Boolean networks accurately defines the components in charge of controlling the dynamics of such systems. However, the calculation of the canonical form might be complicated in mathematical terms. In addition, computing the canonical form does not consider the dynamical properties found when using the synchronous and asynchronous update schemes to solve Boolean networks. Here, we analyze both update schemes and their connection with the canonical form of Boolean networks. We found that the synchronous scheme can be expressed by the Chapman-Kolmogorov equation, being a particular case of Markov chains. We also discovered that the canonical form of any Boolean network can be easily obtained by solving this matrix equation. Finally, we found that, the update order of the asynchronous scheme generates a set of functions that, when composed together, produce characteristic properties of this scheme, such as the conservation of fixed-point attractors or the variability in the basins of attraction. We concluded that the canonical form of Boolean networks can only be obtained for systems that use the synchronous update scheme, which opens up new possibilities for study.