当前位置: X-MOL 学术IEEE Trans. Circuit Syst. II Express Briefs › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Finite-Time Stability of Probabilistic Logical Networks: A Topological Sorting Approach
IEEE Transactions on Circuits and Systems II: Express Briefs ( IF 4.4 ) Pub Date : 2020-04-01 , DOI: 10.1109/tcsii.2019.2919018
Shiyong Zhu , Jianquan Lu , Daniel W. C. Ho

This brief presents some further results on the finite-time stability of probabilistic logical networks (PLNs). By semi-tensor product technique routinely, the dynamic behavior of a PLN is characterized by its corresponding state transition graph (STG). Then, an irradiative result is found. That is, a PLN is globally stable within finite time, if and only if, its STG is acyclic, except for the self loop at the pre-designated vertex. Based on this observation, some properties of STG, which is associated with a finite-time stable PLN, are formulated. The most significant finding is that the determinant of its anti-adjacency matrix is compactly related to the existence of a Hamilton path and is only equal to 0 or 1. Afterwards, the topological sort of all the vertices in STG is defined. As a consequence, two topological sorting algorithms are presented to analyze the stability of PLNs applicably and efficiently. Finally, a simulation example is employed to illustrate the applicability of the obtained results.

中文翻译:

概率逻辑网络的有限时间稳定性:一种拓扑排序方法

本简介介绍了有关概率逻辑网络 (PLN) 的有限时间稳定性的一些进一步结果。通过常规的半张量积技术,PLN 的动态行为由其相应的状态转换图 (STG) 表征。然后,发现辐照结果。也就是说,一个 PLN 在有限时间内是全局稳定的,当且仅当它的 STG 是非循环的,除了在预先指定的顶点处的自循环。基于这一观察,制定了与有限时间稳定 PLN 相关联的 STG 的一些特性。最重要的发现是其反邻接矩阵的行列式与Hamilton 路径的存在紧密相关,且仅等于0 或1。然后,定义了STG 中所有顶点的拓扑排序。作为结果,提出了两种拓扑排序算法来适用和有效地分析PLN的稳定性。最后,通过仿真实例说明所得结果的适用性。
更新日期:2020-04-01
down
wechat
bug