Transition System Representation of Boolean Control Networks

Abstract

In this paper, we propose a transition system (TS) framework for the analysis and design of logical networks. The formula for calculating the fixed points and cycles of a TS is first provided. Then, the TS representation of Boolean networks (BNs) and Boolean control networks (BCNs) is introduced. The first kind of representation is state-based, which converts a BCN into a TS with either distinguished controls or undistinguished ones. The second representation is output-based, which is also called the simulation of the original BCN. Finally, after introducing the notion of output simulation, our method is applied to design output robust controls of logical networks.