Observability of Boolean control networks: A unified approach based on the theories of finite automata

Abstract

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.

8 pages, 9 figures, in press in IEEE Transactions on Automatic Control, 2016

Cited by in corpus (9)

• A Polynomial-Time Algorithm for Solving the Minimal Observability Problem in Conjunctive Boolean Networks
• Sensors Design for Large-Scale Boolean Networks via Pinning Observability
• Output Selection and Observer Design for Boolean Control Networks: A Sub-Optimal Polynomial-Complexity Algorithm
• Formal assessment of some properties of Context-Aware Systems
• On detectability of labeled Petri nets and finite automata
• Online Observability of Boolean Control Networks
• Quotients of probabilistic Boolean networks
• A Boolean Control Network Approach to the Formal Verification of Feedback Context-Aware Pervasive Systems
• A Linear Approach to Fault Analysis and Intervention in Boolean Systems