{"title":"布尔控制网络的输出分解","authors":"Yunlei Zou, Jiandong Zhu","doi":"10.3182/20140824-6-ZA-1003.01525","DOIUrl":null,"url":null,"abstract":"Abstract This paper investigates the decomposition with respect to outputs for Boolean control networks (BCNs). Firstly, based on the linear representation of BCNs, some algebraic equivalent conditions are obtained. Secondly, the concept of perfect equal vertex partition (PEVP) is proposed for BCNs. Thirdly, a necessary and sufficient graphical condition based on the PEVP for the decomposability with respect to outputs is obtained. Finally, an equivalent condition of PEVP is derived to help to calculate a PEVP for a BCN.","PeriodicalId":13260,"journal":{"name":"IFAC Proceedings Volumes","volume":"47 1","pages":"10331-10336"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Decomposition with Respect to Outputs for Boolean Control Networks\",\"authors\":\"Yunlei Zou, Jiandong Zhu\",\"doi\":\"10.3182/20140824-6-ZA-1003.01525\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract This paper investigates the decomposition with respect to outputs for Boolean control networks (BCNs). Firstly, based on the linear representation of BCNs, some algebraic equivalent conditions are obtained. Secondly, the concept of perfect equal vertex partition (PEVP) is proposed for BCNs. Thirdly, a necessary and sufficient graphical condition based on the PEVP for the decomposability with respect to outputs is obtained. Finally, an equivalent condition of PEVP is derived to help to calculate a PEVP for a BCN.\",\"PeriodicalId\":13260,\"journal\":{\"name\":\"IFAC Proceedings Volumes\",\"volume\":\"47 1\",\"pages\":\"10331-10336\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IFAC Proceedings Volumes\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3182/20140824-6-ZA-1003.01525\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IFAC Proceedings Volumes","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3182/20140824-6-ZA-1003.01525","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Decomposition with Respect to Outputs for Boolean Control Networks
Abstract This paper investigates the decomposition with respect to outputs for Boolean control networks (BCNs). Firstly, based on the linear representation of BCNs, some algebraic equivalent conditions are obtained. Secondly, the concept of perfect equal vertex partition (PEVP) is proposed for BCNs. Thirdly, a necessary and sufficient graphical condition based on the PEVP for the decomposability with respect to outputs is obtained. Finally, an equivalent condition of PEVP is derived to help to calculate a PEVP for a BCN.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
