arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1512.02786math.OC
收藏

布尔控制网络可重构性的加权对图表示

A weighted pair graph representation for reconstructibility of Boolean control networks

Kuize Zhang, Lijun Zhang, Rong Su

摘要:

提出了一种新的加权对图(WPG)的概念来表示布尔控制网络(BCN)的一种新的可重构性定义,该定义是[Fornasini & Valcher,TAC 2013,Def.4]中给出的可重构性定义的推广。基于WPG表示,借助有限自动机和形式语言的理论,设计了一种确定BCN新的可重构性概念的有效算法。我们证明了BCN是不可重构的当且仅当它的WPG有一个完全子图。此外,我们还证明了BCN在[Fornasini & Valcher,TAC 2013,Def. 4]意义下是可重构的当且仅当它的WPG没有圈,这比[Fornasini & Valcher,TAC 2013,Thm. 4]。

英文摘要:

A 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 [Fornasini & Valcher, TAC2013, Def. 4]. 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. Besides, we prove that a BCN is reconstructible in the sense of [Fornasini & Valcher, TAC2013, Def. 4] iff its WPG has no cycles, which is simpler to be checked than the condition in [Fornasini & Valcher, TAC2013, Thm. 4].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑