Reduction Techniques for Boolean Networks

Boolean Networks (BNs) are popular qualitative formalisms for the modelling of biological systems. However, their analysis suffer from the state space explosion; there are exponentially many states on the number of BN variables. To enhance tractable analysis of the underlying systems, we facilitate scientists and engineers with techniques and tools. This thesis is a compendium of four research articles that introduce two reduction techniques and their software implementation.
The thesis is separated into two parts. The first part gives a concise, semiformal, and meaningful overview of our research work. Here we navigate the reader through the second part of the thesis, the Appendix,
which includes our contributions in detail. The first paper introduces Boolean backward equivalence, the second article redesigns Boolean backward equivalence method and extends the applications, the third introduces generalised forward bisimulation for the reduction of general dynamical systems (also Boolean Networks), and the fourth article presents the software implementation of Boolean backward equivalence.