Finite-Time Stability of Probabilistic Logical Networks: A Topological Sorting Approach

Abstract

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.