CSpace
A WEIGHTED PAIR GRAPH REPRESENTATION FOR RECONSTRUCTIBILITY OF BOOLEAN CONTROL NETWORKS
Zhang, Kuize1,2; Zhang, Lijun1,3; Su, Rong4
2016
发表期刊SIAM JOURNAL ON CONTROL AND OPTIMIZATION
ISSN0363-0129
卷号54期号:6页码:3040-3060
摘要A 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].
关键词Boolean control network reconstructibility weighted pair graph finite automaton formal language semitensor product of matrices
DOI10.1137/140991285
语种英语
资助项目Fundamental 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研究方向Automation & Control Systems ; Mathematics
WOS类目Automation & Control Systems ; Mathematics, Applied
WOS记录号WOS:000391960900005
出版者SIAM PUBLICATIONS
引用统计
文献类型期刊论文
条目标识符http://ir.amss.ac.cn/handle/2S8OKBNM/24592
专题中国科学院数学与系统科学研究院
通讯作者Zhang, Kuize
作者单位1.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
推荐引用方式
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.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhang, Kuize]的文章
[Zhang, Lijun]的文章
[Su, Rong]的文章
百度学术
百度学术中相似的文章
[Zhang, Kuize]的文章
[Zhang, Lijun]的文章
[Su, Rong]的文章
必应学术
必应学术中相似的文章
[Zhang, Kuize]的文章
[Zhang, Lijun]的文章
[Su, Rong]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。