Analysis and control of Boolean networks: A semi-tensor product approach

By Hongsheng Qi, DaiZhan Cheng. Asian Control Conference, 2010

1,013 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Output tracking control of Boolean control networks with impulsive effects (2018, unknown): “Then, Y ⋉ X = W[m,n] ⋉ X ⋉ Y , (3) where W[m,n] = δmn[1 m + 1 · · · (n − 1)m + 1 2 m + 2 · · · (n − 1)m + 2 · · · m m + m · · · (n − 1)m + m] ∈ mn×mn is the so-called swap matrix.”
On equivalence of matrices (2016, methodology): “ < B means Ais a submonoid of B). This submonoid is useful for calculating the product of tensors over kdimensional vector space [1]. It is particularly useful for k-valued logical dynamic systems [6], [7]. When k= 2, it is used for Boolean dynamic systems. In this sub-monoid the STP can be deﬁne”
Modeling, Analysis and Control of Networked Evolutionary Games (2015, background): “We refer to [13], [14] and the references therein for details.”