{"title":"bnc避免状态集的可达性和可控性","authors":"Zhiqiang Li, Jinli Song","doi":"10.1109/WCICA.2012.6358263","DOIUrl":null,"url":null,"abstract":"In this paper, using semi-tensor product and the vector form of Boolean logical variables, the Boolean control network (BCN) is expressed as a bilinear discrete time system about state and control variables. Based on the algebraic form, the reachability and controllability of BCNs are discussed. Also, the necessary and sufficient conditions for reachability and controllability are given. At last, the control sequence that steers one state to another is constructed. The reachability and controllability discussed here are under certain constraint, where the trajectory of states are avoiding some undesirable states set. The definitions discussed in this paper have practical meaning.","PeriodicalId":114901,"journal":{"name":"Proceedings of the 10th World Congress on Intelligent Control and Automation","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Reachability and controllability of BCNs avoiding states set\",\"authors\":\"Zhiqiang Li, Jinli Song\",\"doi\":\"10.1109/WCICA.2012.6358263\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, using semi-tensor product and the vector form of Boolean logical variables, the Boolean control network (BCN) is expressed as a bilinear discrete time system about state and control variables. Based on the algebraic form, the reachability and controllability of BCNs are discussed. Also, the necessary and sufficient conditions for reachability and controllability are given. At last, the control sequence that steers one state to another is constructed. The reachability and controllability discussed here are under certain constraint, where the trajectory of states are avoiding some undesirable states set. The definitions discussed in this paper have practical meaning.\",\"PeriodicalId\":114901,\"journal\":{\"name\":\"Proceedings of the 10th World Congress on Intelligent Control and Automation\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-07-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 10th World Congress on Intelligent Control and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCICA.2012.6358263\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 10th World Congress on Intelligent Control and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCICA.2012.6358263","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reachability and controllability of BCNs avoiding states set
In this paper, using semi-tensor product and the vector form of Boolean logical variables, the Boolean control network (BCN) is expressed as a bilinear discrete time system about state and control variables. Based on the algebraic form, the reachability and controllability of BCNs are discussed. Also, the necessary and sufficient conditions for reachability and controllability are given. At last, the control sequence that steers one state to another is constructed. The reachability and controllability discussed here are under certain constraint, where the trajectory of states are avoiding some undesirable states set. The definitions discussed in this paper have practical meaning.