• Kalman Decomposition for Boolean Control Networks

  • 发布时间:2015-12-28      访问次数:265
  • 作者: Yunlei Zou,Jiandong Zhu
    文章题目: Kalman Decomposition for Boolean Control Networks
    发表刊物: Automatica
    发表时间: 2015 Vol.54:65-71
    刊物级别: SCI
    学校排名: 第一
    通讯作者: 朱建栋
    原文下载: 点击下载
    备注:
  • 摘要:The Kalman decomposition problem for Boolean control networks (BCNs) is solved completely. A necessary and sufficient condition, described by vertex partitions of digraphs, is proposed for the Kalman decomposition. And, an algorithm is designed to compute the logical coordinate transformation that results in the Kalman decomposition. Finally, two examples are presented. One example illustrates the procedure of realizing the Kalman decomposition. The other one reveals that not all the BCNs can be transformed into the Kalman decomposition form. This is an essential property different from that of the traditional linear control systems.