Set stabilization of Boolean control networks based on bisimulations: A dimensionality reduction approach

Abstract

This paper exploits bisimulation relations, generated by extracting the concept of morphisms between algebraic structures, to analyze set stabilization of Boolean control networks with lower complexity. First, for two kinds of bisimulation relations, called as weak bisimulation and strong bisimulation relations, a novel verification method is provided by constructing the bisimulation matrices. Then the comparison for set stabilization of BCNs via two kinds of bisimulation methods is presented, which involves the dimensionality of quotient systems and dependency of the control laws on the original system. Moreover, the proposed method is also applied to the analysis of probabilistic Boolean control networks to establish the unified analysis framework of bisimulations. Finally, the validity of the obtained results is verified by the practical example.