|
|
Frontiers of Information Technology & Electronic Engineering
ISSN 2095-9184 (print), ISSN 2095-9230 (online)
2020 Vol.21 No.2 P.304-315
Cascading decomposition of Boolean control networks: a graph-theoretical method
Abstract: Two types of cascading decomposition problems of Boolean control networks are investigated using a graph-theoretical method. A new graphic concept called nested perfect equal vertex partition (NPEVP) is proposed. Based on NPEVP, the necessary and sufficient graphic conditions for solvability of the cascading decomposition problems are obtained. Given the proposed graphic conditions, the logical coordinate transformations are constructively obtained to realize the corresponding cascading decomposition forms. Finally, two illustrative examples are provided to validate the results.
Key words: Boolean control networks, Semi-tensor product, Cascading decomposition, Graphic condition
南京师范大学数学科学学院数学研究所，中国南京市，210023
摘要：采用图论方法研究布尔控制网络的两类级联分解问题。提出嵌套完美等点划分（NPEVP）的概念。基于NPEVP，得到级联分解问题可解的充要图条件。给定提出的图条件，可构造性地得到实现相应级联分解形式的逻辑坐标变换。最后，给出两个实例以验证结论。
关键词组：
References:
Open peer comments: Debate/Discuss/Question/Opinion
<1>
DOI:
10.1631/FITEE.1900422
CLC number:
O231
Download Full Text:
Downloaded:
1705
Download summary:
<Click Here>Downloaded:
1440Clicked:
4723
Cited:
0
On-line Access:
2020-03-04
Received:
2019-08-22
Revision Accepted:
2019-10-29
Crosschecked:
2019-11-15