Frontiers of Information Technology & Electronic Engineering
>> 2020,
Volume 21,
Issue 2
doi:
10.1631/FITEE.1900422
Orginal Article
Cascading decomposition of Boolean control networks: a graph-theoreticalmethod
| Institute of Mathematics, School of Mathematical Sciences, Nanjing Normal University, Nanjing 210023, China |
Available online: 2020-04-01
Next
Previous
Abstract
Two types of cascading decomposition problems of Boolean control networks are investigated using a raph-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.
京公网安备 11010502051620号
