布尔控制网络的可观测性:基于有限自动机理论的统一方法
Observability of Boolean control networks: A unified approach based on the theories of finite automata
摘要:
布尔控制网络(BCN)的可观测性问题已经公开了五年。在本文中,我们提出了一个统一的方法来确定所有的四种类型的可观性的BCN的文献。我们定义了BCN的加权对图的概念。在每个可观测性的意义下,我们使用所谓的加权对图将BCN转换为有限自动机,然后使用该自动机来确定可观测性。特别地,确定了文献中依赖于初态和输入的两种可观测性。最后,我们证明了这四种可观测性之间没有一对是等价的,从而揭示了BCN的非线性本质。
英文摘要:
The problem on how to determine the observability of Boolean control networks (BCNs) has been open for five years already. In this paper, we propose a unified approach to determine all the four types of observability of BCNs in the literature. We define the concept of weighted pair graphs for BCNs. In the sense of each observability, we use the so-called weighted pair graph to transform a BCN to a finite automaton, and then we use the automaton to determine observability. In particular, the two types of observability that rely on initial states and inputs in the literature are determined. Finally, we show that no pairs of the four types of observability are equivalent, which reveals the essence of nonlinearity of BCNs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。