Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/87846
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZhang, Kuizeen
dc.contributor.authorZhang, Lijunen
dc.contributor.authorSu, Rongen
dc.date.accessioned2018-12-06T06:21:56Zen
dc.date.accessioned2019-12-06T16:50:41Z-
dc.date.available2018-12-06T06:21:56Zen
dc.date.available2019-12-06T16:50:41Z-
dc.date.issued2016en
dc.identifier.citationZhang, K., Zhang, L., & Su, R. (2016). A weighted pair graph representation for reconstructibility of Boolean control networks. SIAM Journal on Control and Optimization, 54(6), 3040-3060. doi:10.1137/140991285en
dc.identifier.issn0363-0129en
dc.identifier.urihttps://hdl.handle.net/10356/87846-
dc.description.abstractA new concept of weighted pair graphs (WPGs) 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].en
dc.format.extent21 p.en
dc.language.isoenen
dc.relation.ispartofseriesSIAM Journal on Control and Optimizationen
dc.rights© 2016 Society for Industrial and Applied Mathematics (SIAM). This paper was published in SIAM Journal on Control and Optimization and is made available as an electronic reprint (preprint) with permission of Society for Industrial and Applied Mathematics (SIAM). The published version is available at: [http://dx.doi.org/10.1137/140991285]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.en
dc.subjectBoolean Control Networken
dc.subjectReconstructibilityen
dc.subjectDRNTU::Engineering::Electrical and electronic engineeringen
dc.titleA weighted pair graph representation for reconstructibility of Boolean control networksen
dc.typeJournal Articleen
dc.contributor.schoolSchool of Electrical and Electronic Engineeringen
dc.identifier.doi10.1137/140991285en
dc.description.versionPublished versionen
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:EEE Journal Articles
Files in This Item:
File Description SizeFormat 
A weighted pair graph representation for reconstructibility of Boolean control networks.pdf417.71 kBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 10

46
Updated on May 21, 2023

Web of ScienceTM
Citations 10

44
Updated on May 23, 2023

Page view(s)

346
Updated on May 29, 2023

Download(s) 50

86
Updated on May 29, 2023

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.