DocumentCode
724541
Title
Reachability of 2-order logical control networks
Author
Zou Yunlei ; Zhu Jiandong
Author_Institution
Inst. of Math., Nanjing Normal Univ., Nanjing, China
fYear
2015
fDate
23-25 May 2015
Firstpage
5264
Lastpage
5269
Abstract
This paper studies the reachability of 2-order logical control networks (LCNs). First, using semi-tensor product (STP) method of matrices, the matrix expression form of a 2-order LCN is given. Second, a 2-order LCN is converted into another form whose reachability is easy to get by a class of recurrence matrices. Then, the reachability of a 2-order LCN is obtained. Finally, an algorithm is given to find the control sequences realizing the reachability of 2-order LCNs.
Keywords
matrix algebra; network theory (graphs); reachability analysis; tensors; 2-order LCN; 2-order logical control networks; STP method; control sequences; matrix expression; reachability; recurrence matrix; semitensor product; Algorithm design and analysis; Controllability; Education; Matrix converters; Optimal control; Tensile stress; Trajectory; Logical control network; Reachability; Recurrence matrix; Semi-tensor product;
fLanguage
English
Publisher
ieee
Conference_Titel
Control and Decision Conference (CCDC), 2015 27th Chinese
Conference_Location
Qingdao
Print_ISBN
978-1-4799-7016-2
Type
conf
DOI
10.1109/CCDC.2015.7162863
Filename
7162863
Link To Document