Observability of Boolean control networks

@article{Zhu2017ObservabilityOB,
  title={Observability of Boolean control networks},
  author={Qunxi Zhu and Yang Liu and Jianquan Lu and Jinde Cao},
  journal={Science China Information Sciences},
  year={2017},
  volume={61},
  pages={1-12}
}
We show some new results on the observability of Boolean control networks (BCNs). First, to study the observability, we combine two BCNs with the same transition matrix into a new BCN. Then, we propose the concept of a reachable set that results in a given set of initial states, and we derive four additional necessary and sufficient conditions for the observability of BCNs. In addition, we present an algorithm and construct an observability graph to determine the observability of BCNs. Finally… 

Observability of Singular Boolean Control Networks

TLDR
Four types of observability of singular Boolean control networks (SBCNs), are introduced and investigated in this paper and two numerical examples are shown to demonstrate the effectiveness of the theoretical results.

Detectability of Boolean Control Networks

In Chap. 4, we discuss observability of Boolean control networks (BCNs). Intuitively, a BCN is observable if one can use an input sequence and the corresponding output sequence to determine the

A note on observability of switched Boolean control networks

TLDR
Four types of observability of switched Boolean control networks are proposed for the first time and described to describe outputs driven from different input sequences, switching signals and initial states.

Controllability and observability of state‐dependent switched Boolean control networks with input constraints

This paper investigates the controllability and observability of state‐dependent switched Boolean control networks (SDSBCNs) with input constraints. First, the algebraic form of SDSBCNs is derived

Further results on dynamic-algebraic Boolean control networks

TLDR
Restricted coordinate transformation, controllability, observability and topological structures of dynamic-algebraic Boolean control networks are investigated under an assumption that the subsequent state is certain or does not exist.

Minimal observability of Boolean networks

In this study, the minimum observability of Boolean networks (BNs) is investigated by using the semi-tensor product (STP) of matrices. First, a new system based on the considered BN is obtained to

References

SHOWING 1-10 OF 52 REFERENCES

Observability of Boolean Control Networks: A Unified Approach Based on Finite Automata

TLDR
This technical note proposes a unified approach to determine all the four types of observability of BCNs, and defines the concept of weighted pair graphs for BCNs to transform a BCN to a finite automaton and then use the automaton to determine observability.

Observability conditions of Boolean control networks

Observability is a basic, yet challenging, issue when studying Boolean control networks (BCNs). Recently, a criterion for observability of controllable BCNs was proposed by using the algebraic

A note on observability of Boolean control networks

On Pinning Controllability of Boolean Control Networks

TLDR
Analytical investigations of reachability and controllability of Boolean control networks (BCNs) with pinning controllers are presented, and a comparison among three forms of BCNs, which have similar algebraic representations are made.

Observability, Reconstructibility and State Observers of Boolean Control Networks

TLDR
A complete characterization of observability and reconstructibility properties for Boolean networks and Boolean control networks are provided, based both on the Boolean matrices involved in the network description and on the corresponding digraphs.

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

TLDR
This work gives a unified approach to design algorithms to judge whether a given BCN is observable with respect to different observability, and puts forward a concept of weighted pair graph for BCNs, based on the theories of finite automata and formal languages.
...