Transition System Representation of Boolean Control Networks.

The article focuses on developing a transition system (TS) framework for analyzing and designing Boolean control networks (BCNs). It extends existing formulas for calculating fixed points and cycles in Boolean networks (BNs) to TSs and introduces two state-based TS representations of BCNs—distinguished and undistinguished controls—as well as an output-based TS representation called simulation. The paper demonstrates how these representations enable the computation of attractors and control cycles in BCNs and applies the framework to design output robust controls that address disturbance decoupling without regularity assumptions. The methods presented are applicable to general finite-valued logical networks beyond BNs and BCNs.