Description
Analysis and Control of Boolean Networks presents a systematic new approach to the investigation of Boolean control networks. The fundamental tool in this approach is a novel matrix product called the semi-tensor product (STP). Using the STP, a logical function can be expressed as a conventional discrete-time linear system. In the light of this linear expression, certain major issues concerning Boolean network topology – fixed points, cycles, transient times and basins of attractors – can be easily revealed by a set of formulae. This framework renders the state-space approach to dynamic control systems applicable to Boolean control networks. The bilinear-systemic representation of a Boolean control network makes it possible to investigate basic control problems including controllability, observability, stabilization, disturbance decoupling etc.
Table of Contents
Propositional Logic.- Semi-tensor Product of Matrices.- Matrix Expression of Logic.- Logical Equation.- Topological Structure of Boolean Networks.- Input-state Approach of Boolean Control Networks.- Controllability and Observability of BCN.- Realization of BCN.- Stability and Stabilization.- Disturbance Decoupling.- k-valued Network.- Input–Output Decomposition.- Random Boolean Network.- Appendix: Numerical Algorithms.
