Title :
Reachability and controllability of BCNs avoiding states set
Author :
Li, Zhiqiang ; Song, Jinli
Author_Institution :
Dept. of Math. & Inf. Sci., Henan Univ. of Econ. & Law, Zhengzhou, China
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.
Keywords :
Boolean algebra; bilinear systems; controllability; discrete time systems; reachability analysis; tensors; BCN; Boolean control network; Boolean logical variable; bilinear discrete time system; control sequence; control variable; controllability; necessary and sufficient condition; reachability; semitensor product; state variable; Controllability; Discrete time systems; Indexes; Linear systems; Matrices; Trajectory; Vectors; Boolean control network; Perron-Frobenius theory; controllability; nonnegative matrices; reachability;
Conference_Titel :
Intelligent Control and Automation (WCICA), 2012 10th World Congress on
Conference_Location :
Beijing
Print_ISBN :
978-1-4673-1397-1
DOI :
10.1109/WCICA.2012.6358263
