CSpace
A WEIGHTED PAIR GRAPH REPRESENTATION FOR RECONSTRUCTIBILITY OF BOOLEAN CONTROL NETWORKS
Zhang, Kuize1,2; Zhang, Lijun1,3; Su, Rong4
2016
Source PublicationSIAM JOURNAL ON CONTROL AND OPTIMIZATION
ISSN0363-0129
Volume54Issue:6Pages:3040-3060
AbstractA new concept of weighted pair graphs (WPCs) is proposed to represent a new reconstructibility definition for Boolean control networks (BCNs), which is a generalization of the reconstructibility definition given in Definition 4 in [E. Fornasini and M. Valcher, IEEE Trans. Automat. Control, 58 (2013), pp. 1390-1401]. Based on the WPG representation, an effective algorithm for determining the new reconstructibility notion for BCNs is designed with the help of the theories of finite automata and formal languages. We prove that a BCN is not reconstructible iff its WPG has a complete subgraph. In addition, we prove that a BCN is reconstructible in the sense of Definition 4 in [E. Fornasini and M. Valcher, IEEE Trans. Automat. Control, 58 (2013), pp. 1390-1401] iff its WPG has no cycles, which is simpler to check than the condition in Theorem 4 in [E. Fornasini and M. Valcher, IEEE Trans. Automat. Control, 58 (2013), pp. 1390-1401].
KeywordBoolean control network reconstructibility weighted pair graph finite automaton formal language semitensor product of matrices
DOI10.1137/140991285
Language英语
Funding ProjectFundamental Research Funds for the Central Universities[HEUCF160404] ; Natural Science Foundation of Heilongjiang Province of China[LC2016023] ; National Natural Science Foundation of China[61573288] ; Program for New Century Excellent Talents in University of Ministry of Education of China
WOS Research AreaAutomation & Control Systems ; Mathematics
WOS SubjectAutomation & Control Systems ; Mathematics, Applied
WOS IDWOS:000391960900005
PublisherSIAM PUBLICATIONS
Citation statistics
Cited Times:13[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/24592
Collection中国科学院数学与系统科学研究院
Affiliation1.Harbin Engn Univ, Coll Automat, Harbin 150001, Peoples R China
2.Chinese Acad Sci, Inst Syst Sci, Beijing 100190, Peoples R China
3.Northwestern Polytech Univ, Sch Marine Sci & Technol, Xian 710072, Peoples R China
4.Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
Recommended Citation
GB/T 7714
Zhang, Kuize,Zhang, Lijun,Su, Rong. A WEIGHTED PAIR GRAPH REPRESENTATION FOR RECONSTRUCTIBILITY OF BOOLEAN CONTROL NETWORKS[J]. SIAM JOURNAL ON CONTROL AND OPTIMIZATION,2016,54(6):3040-3060.
APA Zhang, Kuize,Zhang, Lijun,&Su, Rong.(2016).A WEIGHTED PAIR GRAPH REPRESENTATION FOR RECONSTRUCTIBILITY OF BOOLEAN CONTROL NETWORKS.SIAM JOURNAL ON CONTROL AND OPTIMIZATION,54(6),3040-3060.
MLA Zhang, Kuize,et al."A WEIGHTED PAIR GRAPH REPRESENTATION FOR RECONSTRUCTIBILITY OF BOOLEAN CONTROL NETWORKS".SIAM JOURNAL ON CONTROL AND OPTIMIZATION 54.6(2016):3040-3060.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Zhang, Kuize]'s Articles
[Zhang, Lijun]'s Articles
[Su, Rong]'s Articles
Baidu academic
Similar articles in Baidu academic
[Zhang, Kuize]'s Articles
[Zhang, Lijun]'s Articles
[Su, Rong]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Zhang, Kuize]'s Articles
[Zhang, Lijun]'s Articles
[Su, Rong]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.