arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.12468eess.SYcs.SY
收藏

概率布尔网络的最小可观测性

Minimum observability of probabilistic Boolean networks

Jiayi Xu, Shihua Fu, Liyuan Xia, Jianjun Wang

AI总结:

针对概率布尔网络的最小可观测性问题,本文基于半张量积、并行系统与鲁棒集合可达性提出 H-可区分状态搜索及最少测量求解方法,并通过算例验证有效性。

摘要:

本文研究概率布尔网络(PBNs)的最小可观测性,其主要目标是通过增加最少的测量,使不可观测的 PBN 变为可观测。首先,借助矩阵的半张量积(STP)建立 PBN 的代数形式。通过将两个相同 PBN 的代数形式组合成一个并行系统,基于鲁棒集合可达性技术,提出了一种搜索需要满足 H-可区分状态的方法。其次,给出了寻找最小测量集合的充要条件,使给定集合能够 H-可区分。此外,通过比较所有可行的 H-可区分状态集所需的测量数量,得到使系统可观测所需的最少测量。最后,通过一个算例验证了所得结果的有效性。

英文摘要:

This paper studies the minimum observability of probabilistic Boolean networks (PBNs), the main objective of which is to add the fewest measurements to make an unobservable PBN become observable. First of all, the algebraic form of a PBN is established with the help of semi-tensor product (STP) of matrices. By combining the algebraic forms of two identical PBNs into a parallel system, a method to search the states that need to be H-distinguishable is proposed based on the robust set reachability technique. Secondly, a necessary and sufficient condition is given to find the minimum measurements such that a given set can be H-distinguishable. Moreover, by comparing the numbers of measurements for all the feasible H-distinguishable state sets, the least measurements that make the system observable are gained. Finally, an example is given to verify the validity of the obtained results.

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

↑