Paper Info
Title
A Weighted Pair Graph Representation for Reconstructibility of Boolean Control Networks.
Abstract
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].
Year
DOI
Venue
2016
10.1137/140991285
SIAM JOURNAL ON CONTROL AND OPTIMIZATION
Keywords
DocType
Volume
Boolean control network,reconstructibility,weighted pair graph,finite automaton,formal language,semitensor product of matrices
Journal
54
Issue
ISSN
Citations 
6
0363-0129
9
PageRank 
References 
Authors
0.46
15
3
Name
Order
Citations
PageRank
Kuize Zhang117611.72
Lijun Zhang224537.10
Rong Su331845.41