By Topic

State–Space Analysis of Boolean Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Daizhan Cheng ; Key Lab. of Syst. & Control, Chinese Acad. of Sci., Beijing, China ; Hongsheng Qi

This paper provides a comprehensive framework for the state-space approach to Boolean networks. First, it surveys the authors' recent work on the topic: Using semitensor product of matrices and the matrix expression of logic, the logical dynamic equations of Boolean (control) networks can be converted into standard discrete-time dynamics. To use the state-space approach, the state space and its subspaces of a Boolean network have been carefully defined. The basis of a subspace has been constructed. Particularly, the regular subspace, Y-friendly subspace, and invariant subspace are precisely defined, and the verifying algorithms are presented. As an application, the indistinct rolling gear structure of a Boolean network is revealed.

Published in:

Neural Networks, IEEE Transactions on  (Volume:21 ,  Issue: 4 )