Author | Conference | Journal | Organization | Year | DOI
Look for results that meet for the following criteria:
Academic
Publications
Disturbance Decoupling of Boolean Control Networks

Disturbance Decoupling of Boolean Control Networks,10.1109/TAC.2010.2050161,IEEE Transactions on Automatic Control,Daizhan Cheng

Edit
Disturbance Decoupling of Boolean Control Networks   (Citations: 9)
BibTex | RIS | RefWorks Download
Journal: IEEE Transactions on Automatic Control - IEEE TRANS AUTOMAT CONTR , vol. 56, no. 1, pp. 2-10, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
    • ...Somefundamentalcontrolproblems,suchascontrollability,observability, realization, and disturbance decoupling of Boolean control networks, are investigated in [26]‐[28]...

    Yin Zhao, et al. Optimal Control of Logical Control Networks

    • ...Using it, some fundamental problems of Boolean networks are investigated, such as topological structure [4], controllability and observability [5], realization [6] and disturbance decoupling [7, 8]. In Boolean networks, the gene state is quantized to only two levels: True and False...
    • ...Motivated by [7], we give a constructive method to find the �� -friendly subspaces in the following...

    Zhenbin Liu, et al. Disturbance decoupling of multi-valued logical networks

    • ...Using this basic tool and two key techniques, we have investigated (i) the topological structure of Boolean networks(BN) [17]; (ii) the controllability, observability of Boolean control networks (BCN) [13, 54]; (iii) the realization of BCN [15]; (iv) the decoupling of BCN [19]; (v) the stability of BN and the stabilization of BCN [20]; (vi) the optimal control of BC-N [55, 56]; (vii) identification of BN and BCN [21, 22]; (viii) ...
    • ...This section considers only the disturbance decoupling problem, which is based on [19]...
    • ...Then we have the following result [19] Theorem 9.3 Assume y = � p=1 yi has its algebraic form...
    • ...We refer to [19] for the algorithm for constructing Yfriendly subspaces...
    • ...Again, we refer to [19] for the technique to design the controls...

    Daizhan Cheng, et al. Synthesis of Boolean networks via semi-tensor product

    • ...Boolean control networks, for instance, in disturbance decoupling problems [4]...

    Daizhan Cheng, et al. Normal form of general logic mappings

    • ...Then, a Boolean (control) network is expressed in its algebraic form [18], and many properties of Boolean (control) networks are investigated using this approach [19, 20, 21, 22]...

    Yin Zhao. A Floyd-like algorithm for optimization of mix-valued logical control ...

Sort by:

Citations (9)

Share this on