Set Stabilization of Probabilistic Boolean Control Networks: A Sampled-Data Control Approach

Xu, Mengxia; Liu, Yang; Lou, Jungang; Wu, Zheng‐Guang; Zhong, Jie

doi:10.1109/tcyb.2019.2940654

Cited by 35 publications

(16 citation statements)

References 39 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In addition, it can be calculated that L= δ 64 [2,6,2,6, 1, 5, 5, 5, 14, 14, 14, 14, 13, 13, 13, 13,18, 22, 20, 24, 17, 21, 21, 23, 30, 30, 32, 32, 29, 29, 29, 31, 33, 37, 33, 37, 33, 37, 37, 37, 45, 45, 45, 45, 45, 45, 45, 45, 49, 10,14,9,13,13,13,14,14,14,14,13,13,13,13,26,30,28,32,25,29,29,31,30,30,32,32,29,29,29,31,33,37,33,37,33,37,37,37,37,37,37,37,37,37,37,37,49,53,51,…”

Section: Numerical Simulationsmentioning

confidence: 99%

See 1 more Smart Citation

Synchronization of Coupled Boolean Networks With Different Update Scheme

2020

View full text Add to dashboard Cite

In this paper, the synchronization of coupled Boolean networks with asynchronous update scheme is investigated. First, the asynchronous Boolean dynamics is transformed into a linear expression with the semi-tensor product technique. Then, the synchronization cycle is proposed to establish the synchronization conditions of asynchronous Boolean networks. Furthermore, an algorithm is given, which can be used to quickly check whether there exists the synchronization cycle in the coefficient matrix of the Boolean function. Finally, an example is provided to verify the efficiency of the theoretical analysis. INDEX TERMS Asynchronous update scheme, Boolean network, synchronization, semi-tensor product.

show abstract

Section: Numerical Simulationsmentioning

confidence: 99%

“…Since Boolean network (BN) can effectively capture the dynamics behaviors in complex systems, it has been extensively used for analyzing the gene regulatory network [1]- [14]. In 1969, the Boolean network was first used to describe the gene regulatory network by Kauffman [15].…”

Section: Introductionmentioning

confidence: 99%

Synchronization of Coupled Boolean Networks With Different Update Scheme

2020

View full text Add to dashboard Cite

show abstract

“…By utilizing the method of STP, logical systems can be converted into their corresponding algebraic forms. Based on these, many interesting results have been found, including controllability [8,9], stability and stabilization [10][11][12][13][14][15], function perturbation [16], observability [17], disturbance decoupling [18], output tracking [19] and optimal control [20]. Additionally, the STP can be also applied in the game [21] and fault detection for logical circuits [22].…”

Section: Introductionmentioning

confidence: 99%

Boolean-network-based approach for construction of filter generators

2020

Sci. China Inf. Sci.

View full text Add to dashboard Cite

In this paper, we view filter generators as Boolean networks (BNs), and discuss their poweranalysis-based side-channel analysis. An incompletely specified binary sequence always contains some bits called unnecessary bits comprising 1 or 0. Our motivation for considering this type of sequence is to reduce direct dependencies between side-channel information and key sequences. An algorithm is proposed to determine the unnecessary bits to increase the key search time required for adversaries rather than simply turning all unnecessary bits to 0 (or 1). Then, to reduce area dissipation, under the framework of semi-tensor product (STP) of matrices, the problem of constructing filter generators with minimum number of stages is converted into the one of determining the corresponding transition matrices. Compared with the existing results, the lower bound of the minimum number of stages is provided, which can reduce the exhaustive search time required to find it. Finally, one example is used to illustrate the efficacy of the proposed algorithm.

show abstract

“…Logical networks are proved to be a more effective tool to study finite‐valued systems than Boolean networks, dynamics games [5] for example. See more applications of logical networks in [6–16].…”

Section: Introductionmentioning

confidence: 99%