Further Results on the Controllability of Boolean Control Networks

@article{Zhu2019FurtherRO,
  title={Further Results on the Controllability of Boolean Control Networks},
  author={Qunxi Zhu and Yang Liu and Jianquan Lu and Jinde Cao},
  journal={IEEE Transactions on Automatic Control},
  year={2019},
  volume={64},
  pages={440-442}
}
This note presents further results based on the recent paper [J. Liang, H. Chen, and J. Lam, “An improved criterion for controllability of Boolean control networks,” <italic>IEEE Trans. Autom. Control</italic>, vol. 62, no. 11, pp. 6012–6018, Nov. 2017]. After some optimizations, the conventional method can be more efficient than the method used in the above paper. We also propose an improved method via combining the well known Tarjan's algorithm and depth-first search technique for the… 

Figures and Tables from this paper

Controllability and Observability of Boolean Control Networks via Sampled-Data Control

TLDR
It is proved that an SDBCN is observable, if and only if <inline-formula><tex-math notation="LaTeX">$\Vert {\mathcal {U}}^*\Vert _1=N^2-N$</tex- math></inline- formula> is the number of state-variables of BNs.

Categorization Problem on Controllability of Boolean Control Networks

TLDR
This article develops a method, via algebraic graph theoretic approach, to determine whether the set of reachable time steps and theset of unreachable time steps, associated with the given pair of states, are finite or infinite.

Controllability and stabilization of Boolean control networks by the auxiliary function of flipping

In this article, a hybrid method combining flip matrix approach and an open (or closed) loop control is proposed to study global controllability and stabilization of Boolean control networks (BCNs).

A General Control Framework for Boolean Networks

TLDR
An important theorem is proved to reveal the equivalence between several types of stability, and the existing difficulties on the stabilization in probability are then solved to some extent via the structurally controllable criterion.

Infinite-Horizon Optimal Control of Switched Boolean Control Networks With Average Cost: An Efficient Graph-Theoretical Approach

TLDR
Results show that the proposed graph-theoretical approach is much more computationally efficient and can reduce the running time dramatically: it runs hundreds or even thousands of times faster than the existing methods.

Sampled-Data State-Feedback Stabilization of Probabilistic Boolean Control Networks: A Control Lyapunov Function Approach

TLDR
This article investigates the partial stabilization problem of probabilistic Boolean control networks (PBCNs) under sample-data state-feedback control (SDSFC) with a control Lyapunov function (CLF) approach and finds that the existence of a CLF is equivalent to that of SDSFC.

Finite-Horizon Optimal Control of Boolean Control Networks: A Unified Graph-Theoretical Approach

TLDR
This article investigates the finite-horizon optimal control (FHOC) problem of Boolean control networks (BCNs) from a graph theory perspective and is the first one capable of solving Problem 2) with time-variant costs.

Set Invariance and Optimal Set Stabilization of Boolean Control Networks: A Graphical Approach

TLDR
Results show that in accordance with time complexity analysis, the algorithms can dramatically reduce the running time for the first two problems compared with existing work, and effectively solve the general optimal set stabilization problem.
...

References

SHOWING 1-10 OF 21 REFERENCES

An Improved Criterion for Controllability of Boolean Control Networks

TLDR
By resorting to the semi-tensor product technique and the Warshall algorithm, several improved novel reachability and controllability criteria are obtained for the BCNs through constructing a sequence of rigorous Boolean matrices.

Controllability Analysis and Control Design for Switched Boolean Networks with State and Input Constraints

This paper investigates the controllability analysis and the control design for switched Boolean networks (SBNs) with state and input constraints by using the semi-tensor product method and presents

Controllability and Observability of Boolean Control Networks With Time-Variant Delays in States

  • Lijun ZhangKuize Zhang
  • Mathematics, Computer Science
    IEEE Transactions on Neural Networks and Learning Systems
  • 2013
TLDR
This brief investigates the controllability and observability of Boolean control networks with (not necessarily bounded) time-variant delays in states and splits the system into a finite number of subsystems with no time delays by using the idea of splitting time.

Optimal Control of Boolean Control Networks

TLDR
It is proved that a significant number of optimal control problems for BCNs can be easily reframed into the present setup and the cost function can be adjusted so as to include penalties on the switchings, provided that the size of the BCN state variable is augmented.

Controllability of Boolean control networks via the Perron-Frobenius theory

Controllability and observability of Boolean control networks

TLDR
It is shown that the problem of determining whether a BCN is observable or not is NP-hard, and it is suggested that there is no algorithm with polynomial time complexity that solves the observability problem.

On Controllability of Delayed Boolean Control Networks

TLDR
This paper is devoted to studying the trajectory and state controllability of Boolean control networks (BCNs) with time delay, and uses the semi-tensor product of matrices to convert the delayed BCNs into an equivalent algebraic description.

Control of Boolean networks: hardness results and algorithms for tree structured 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.