Research article Special Issues

Distributed pinning controllers design for set stabilization of k-valued logical control networks

  • Received: 23 September 2022 Revised: 28 January 2023 Accepted: 07 February 2023 Published: 15 February 2023
  • Design of distributed pinning controllers for set stabilization of k-valued logical control networks is investigated in this paper. Firstly, by analyzing the coupling correlations among nodes, pinned node set is determined. Secondly, based on the solvability of a class of matrix equations, sufficient conditions which resort to local information are put forward for the design of pinning controllers. Furthermore, an algorithm for designing pinning feedback controllers is presented, where the designed controllers are related to part of state variables instead of all variables. Finally, two illustrative examples are presented to verify the effectiveness of the main results.

    Citation: Yanfei Wang, Changxi Li, Jun-e Feng. Distributed pinning controllers design for set stabilization of k-valued logical control networks[J]. Mathematical Modelling and Control, 2023, 3(1): 61-72. doi: 10.3934/mmc.2023006

    Related Papers:

    [1] Buthinah A. Bin Dehaish, Rawan K. Alharbi . On fixed point results for some generalized nonexpansive mappings. AIMS Mathematics, 2023, 8(3): 5763-5778. doi: 10.3934/math.2023290
    [2] Sani Salisu, Vasile Berinde, Songpon Sriwongsa, Poom Kumam . Approximating fixed points of demicontractive mappings in metric spaces by geodesic averaged perturbation techniques. AIMS Mathematics, 2023, 8(12): 28582-28600. doi: 10.3934/math.20231463
    [3] Mohd Jubair, Faizan Ahmad Khan, Javid Ali, Yeşim Saraç . Estimating fixed points of non-expansive mappings with an application. AIMS Mathematics, 2021, 6(9): 9590-9601. doi: 10.3934/math.2021558
    [4] Noor Muhammad, Ali Asghar, Samina Irum, Ali Akgül, E. M. Khalil, Mustafa Inc . Approximation of fixed point of generalized non-expansive mapping via new faster iterative scheme in metric domain. AIMS Mathematics, 2023, 8(2): 2856-2870. doi: 10.3934/math.2023149
    [5] Lu-Chuan Ceng, Yeong-Cheng Liou, Tzu-Chien Yin . On Mann-type accelerated projection methods for pseudomonotone variational inequalities and common fixed points in Banach spaces. AIMS Mathematics, 2023, 8(9): 21138-21160. doi: 10.3934/math.20231077
    [6] Yasir Arfat, Supak Phiangsungnoen, Poom Kumam, Muhammad Aqeel Ahmad Khan, Jamshad Ahmad . Some variant of Tseng splitting method with accelerated Visco-Cesaro means for monotone inclusion problems. AIMS Mathematics, 2023, 8(10): 24590-24608. doi: 10.3934/math.20231254
    [7] Godwin Amechi Okeke, Akanimo Victor Udo, Rubayyi T. Alqahtani, Nadiyah Hussain Alharthi . A faster iterative scheme for solving nonlinear fractional differential equations of the Caputo type. AIMS Mathematics, 2023, 8(12): 28488-28516. doi: 10.3934/math.20231458
    [8] Junaid Ahmad, Kifayat Ullah, Reny George . Numerical algorithms for solutions of nonlinear problems in some distance spaces. AIMS Mathematics, 2023, 8(4): 8460-8477. doi: 10.3934/math.2023426
    [9] Junaid Ahmad, Imen Ali Kallel, Ahmad Aloqaily, Nabil Mlaiki . On multi-valued generalized α-nonexpansive mappings and an application to two-point BVPs. AIMS Mathematics, 2025, 10(1): 403-419. doi: 10.3934/math.2025019
    [10] Shahram Rezapour, Maryam Iqbal, Afshan Batool, Sina Etemad, Thongchai Botmart . A new modified iterative scheme for finding common fixed points in Banach spaces: application in variational inequality problems. AIMS Mathematics, 2023, 8(3): 5980-5997. doi: 10.3934/math.2023301
  • Design of distributed pinning controllers for set stabilization of k-valued logical control networks is investigated in this paper. Firstly, by analyzing the coupling correlations among nodes, pinned node set is determined. Secondly, based on the solvability of a class of matrix equations, sufficient conditions which resort to local information are put forward for the design of pinning controllers. Furthermore, an algorithm for designing pinning feedback controllers is presented, where the designed controllers are related to part of state variables instead of all variables. Finally, two illustrative examples are presented to verify the effectiveness of the main results.



    The idea of a fixed point was started in 19th century and different mathematicians, like Schauder, Tarski, Brouwer [1,2,3] and others worked on it in 20th century. The presence for common fixed points of different families with nonexpansive and contractive mappings in Hilbert spaces as well as in Banach spaces was the exhaustive topic of research since the early 1960s as explored by many researchers like Banach, Brouwer and Browder etc. Latterly, Khamsi and Kozlowski [4,5] proved results in modular function spaces for common fixed points of nonexpansive, asymptotically nonexpansive and contractive mappings. The theory of a fixed point has a substantial position in the fields of analysis, geometry, engineering, topology, optimization theory, etc. For some latest algorithms developed in the fields of optimisation and inverse problems, we refer to [6,7]. For more detailed study of fixed point and applications, see [8,9,10,11,12,13,14,15,16,17,18,19,20,21,22] and the references there in.

    The concept of fixed points of one parameter semigroups of linear operators on a Banach space was originated from 19th century from the remarkable work of Hille-Yosida in 1948. Now-a-days, it has a lot of applications in many fields such as stochastic processes and differential equations. Semigroups have a monumental position in the fields of functional analysis, quantum mechanics, control theory, functional equations and integro-differential equations. Semigroups also play a significant role in mathematics and application fields. For example, in the field of dynamical systems, the state space will be defined by the vector function space and the system of an evolution function of the dynamical system will be represented by the map (h)kT(h)k. For related study, we refer to [23].

    Browder [24] gave a result for the fixed point of nonexpansive mappings in a Banach space. Suzuki [25] proved a result for strong convergence of a fixed point in a Hilbert space. Reich [26] gave a result for a weak convergence in a Banach space. Similarly, Ishikawa [27] presented a result for common fixed points of nonexpansive mappings in a Banach space. Reich and Shoikhet also proved some results about fixed points in non-linear semigroups, see [20]. Nevanlinna and Reich gave a result for strong convergence of contraction semigroups and of iterative methods for accretive operators in Banach spaces, see [28,29]. There are different results on strong convergence of a fixed point of semigroups and there are sets of common fixed points of semigroups by the intersection of two operators from the family. These results are much significant in the field of fixed point theory. In a recent time, different mathematicians are working to generalize such type of results for a subfamily of an evolution family, see [30,31,32].

    The fixed point of a periodic evolution subfamily was discussed in [30] by Rahmat et al. They gave a result for finding common fixed points of the evolution subfamily with the help of a strongly converging sequence. The method applied in [30] is successfully useful for showing the presence of a fixed point of an evolution subfamily. The purpose of this work is to show the existence of a fixed point of an evolution subfamily with the help of a sequence acting on a Banach space.

    Definition 1.1. Let v: AA be a self-mapping. A point rA is a fixed point of v if v(r)=r.

    The idea of semigroups is originated from the solution of the Cuachy differnetial equations of the form:

    {˙Λ(b)=K(Λ(b)),b0,Λ(0)=Λ0,

    where K is a linear operator.

    Definition 1.2. A family Y={Y(a);a0} of bounded linear operators is a semigroup if the following conditions hold:

    (i) Y(0)=I.

    (ii) Y(j+k)=Y(j)Y(k), j,k0.

    When K=K(t), then such a system is called a non-autonomous system. The result of this system produces the idea of an evolution family.

    Definition 1.3. A family E={E(u,g);ug0} of bounded linear operators is said to be an evolution family if the following conditions hold:

    (i) E(p,p)=I, p0.

    (ii) E(j,q)E(q,b)=E(j,b), jqb0.

    Remark 1.4. If the evolution family is periodic of each number r0, then it forms a semigroup. If we take E(c,0)=Y(c), then

    (a1) Y(0)=E(0,0)=I.

    (a2) Y(c+y)=E(c+y,0)=E(c+y,y)E(y,0)=E(c,0)E(y,0)=Y(c)Y(y), which shows that a periodic evolution family of each positive period, is a semigroup.

    Similarly, if we take Y(rd)=E(r,d), then

    (b1) E(r,r)=Y(0)=I.

    (b2) E(r,b)=E(r,d)E(d,b)=Y(rd)Y(db)=Y(rb), which shows that a semigroup is an evolution family.

    Remark 1.5. A semigroup is an evolution family, but the converse is not true. In fact, the converse holds if the evolution family is periodic of every number s0.

    Remark 1.6. [33] Let 0s1 and b,kH, then the following equality holds:

    ||sb+(1s)k||2=s||b||2+(1s)||k||2s(1s)||bk||2.

    In this work, we will generalize results from [33] for an evolution subfamily and also give some other results for an evolution subfamily.

    First, denote the set of real numbers and natural numbers by R and N, respectively. We denote the family of semigroups by Y, evolution family by E and evolution subfamily by G. By B, H and D, we will indicate a Banach space, Hilbert space and a convex closed set, respectively. We use for a strong and for a weak convergence. The set of fixed points of

    G={G(s,0);s0}

    is denoted by

    F(G)=s0F(G(s,0)).

    We generalize results of semigroups from [33] for an evolution subfamily G in a Banach space. These types of families are not semigroups. The following example illustrates this fact and gives the difference between them.

    Example 2.1. As

    E={E(h,r)=h+1r+1;hr0}

    is an evolution family because it satisfies both conditions of an evolution family.

    If we take r=0, that is, {E(h,0)}=G, then it becomes a subfamily of E and it is not a semigroup.

    Suzuki proved the following result in [25]:

    Theorem 2.2. Consider a family

    Y={Y(i),i0}

    of strongly continuous non-expansive operators on D (where D is a subset of a Hilbert space H) such that F(Y). Take two sequences {γm} and {qm} in R with

    limmqm=limmγmqm=0,

    qm>0 and γm(0,1). Let bD be fixed and {km} be a sequence in D such that

    km=γmb+(1γm)Y(qm)km,  mN,

    then {km}hF(Y).

    The following result was given by Shimizu and Takahashi [15] in 1998:

    Theorem 2.3. Take a family

    Y={Y(i),i0}

    of operators which are non-expansive and strongly continuous on DH such that F(Y). Take two sequences {ζm} and {λm} in R with

    limmζm=0,limmλm=,

    where ζm(0,1) and λm>0. Let cD be fixed and {gm}D be a sequence such that

    gm=ζmc+(1ζm)1λmλm0Y(s)ds

    for all mN. Then {gm}aF(Y).

    Motivated from above results, we take an implicit iteration for G={G(b,0),b0} of nonexpansive mappings, given as:

    {τm=γmτm1+(1γm)G(ζm,0)τm, m1,τ0D. (2.1)

    We present some results for convergence of Eq (2.1) in a Banach space and a Hilbert space for a nonexpansive evolution subfamily.

    We start with the following lemmas:

    Lemma 3.1. Consider an evolution family E and a subfamily G={G(c,0);c0} of E with period rR+, then

    c0F(G(c,0))=0crF(G(c,0)).

    Proof. As it is obviously true that

    c0F(G(c,0))0crF(G(c,0)),

    we are proving the other part, i.e.,

    0crF(G(c,0))c0F(G(c,0)).

    Take a real number

    k0crF(G(c,0)),

    then

    G(c,0)k=k, 0cr.

    As we know that any real number c0 is written in the form of c=mr+ε, for some mZ+ and 0εr, consider

    G(c,0)k=G(mr+ε,0)k=G(mr+ε,mr)G(mr,0)k=G(ε,0)Gm(r,0)k=G(ε,0)k=k.

    This shows that

    0crF(G(c,0))c0F(G(c,0)).

    Hence, we conclude that

    c0F(G(c,0))=0crF(G(c,0)).

    This completes the proof.

    Lemma 3.2. If Y={Y(β);β0} is a semigroup on a Hilbert space H, then

    F(Y)=β0F(Y(β))=0β1F(Y(β)).

    Proof. Since

    β0F(Y(β))0β1F(Y(β)),

    we only prove the other part, that is,

    0β1F(Y(β))β0F(Y(β)).

    Take a real number u such that

    u0β1F(Y(β)),

    then we have Y(u)=u, for every β[0,1]. Since β[0,1], we can write it as β=n+ϱ, where nZ+ and 0ϱ1. Therefore, we have

    Y(β)u=Y(n+ϱ)u=Y(n)Y(ϱ)u=Yn(1)Y(ϱ)u=Yn(1)u=u.

    This shows that uβ0F(Y(β)). It implies that

    0β1F(Y(β))β0F(Y(β)).

    Thus,

    β0F(Y(β))=0β1F(Y(β)).

    This completes the proof.

    Now, we give a result for a weak convergence of a sequence in a Hilbert space.

    Theorem 3.3. Let G={G(a,0)} be a subfamily of E of strongly continuous nonexpansive operators on D and F(G), where D is a subset of H. Take two sequences {γm} and {ζm} in R such that

    {γm}(0,c](0,1),ζm>0,
    lim infmζm=0,lim supmζm>0,

    and

    limm(ζm+1ζm)=0.

    Then

    τm=γmτm1+(1γm)G(ζm,0)τmτ,

    where τF(G).

    Proof. Claim (ⅰ). For any zF(G), limm||τmz|| exists. In fact,

    ||τmz||=||γm(τm1z)+(1γm)(G(ζm,0)τmz)||γm||τm1z||+(1γm)||G(ζm,0)τmz||γm||τm1z||+(1γm)||τm1z||,  m1.

    Thus, we have

    ||τmz||||τm1z||,  m1.

    This shows that limm||τmz|| exists. Therefore, the sequence {τm} is bounded.

    Claim (ⅱ).

    limm||G(ζm,0)τmτm||=0.

    From Remark 1.6, we have

    ||τmz||2=||γm(τm1z)+(1γm)(G(ζm,0)τmz)||2=γm||τm1z||2+(1γm)||G(ζm,0)τmz||2γm(1γm)||τm1G(ζm,0)τm||2γm||τm1z||2+(1γm)||τmz||2γm(1γm)||τm1G(ζm,0)τm||2.

    Thus, we have

    ||τmz||2||τm1z||2(1γm)||τm1G(ζm,0)τm||2,  m1.

    As we know that {γm}(0,c](0,1), so we have

    (1c)||τm1G(ζm,0)τm||2||τm1z||2||τmz||2, (3.1)

    i.e.,

    (1c)lim supm||τm1G(ζm,0)τm||2lim supm||τm1z||2||τmz||2=0.

    Therefore,

    limm||τm1G(ζm,0)τm||=0.

    On the other hand,

    limm||τmG(ζm,0)τm||=limmγm1||τm1G(ζm,0)τm||=0.

    Claim (ⅲ).

    {τm}τ,  where  τF(G).

    As {τm} is bounded, take a subsequence {ωmi} of {τm} such that {ωmi}τ. Let ωmi=hi, γmi=ξi and ζmi=vi. From [34], we have

    limivi=limi||hiG(vi,0)hi||vi=0.

    Now, we will show that G(ζ,0)τ=τ.

    We have

    ||hiG(ζ,0)τ||[ζvi]1a=0||G((a+1)vi,0)hiG(avi,0)hi||+||G([ζvi]vi,0)hiG(ζvivi,0)τ||+||G(ζvivi,0)τG(ζ,0)||ζvi||G(vi,0)hihi||+||hiτ||+||G(ζ[ζvi]vi,0)ττ||ζ||G(vi,0)hihi||vi+||hiτ||+max0vvi||G(v,0)ττ||,  iN.

    Thus, we get

    lim supi||hiG(ζ,0)τ||lim supi||τiτ||.

    Hence, G(ζ,0)τ=τ by using Opial's condition. Therefore, τF(G). Now, we need to show that {τm}τ. For this, take a subsequence {ηmj} of {τm} such that ηmju and uτ. By above method, we can show that uF(G). Since both limits limm||τmτ|| and limm||τmu|| exist, we can write

    limm||τmτ||=lim supi||ωmiτ||<lim supi||ωmiu||=limm||τmu||=lim supj||ηmju||<lim supj||ηmjτ||=limm||τmτ||.

    It shows that u=τ, which is a contradiction. Thus, τmτ.

    This completes the proof.

    Now, we will provide a theorem in a Banach space for a weak convergence.

    Theorem 3.4. Consider a reflexive Banach space B in R with Opial's property and a subset D of B. Let G={G(a,0)} be a subfamily of E of nonexpansive and strongly continuous mappings such that F(G). Take two sequences {γm} and {ζm} such that γm(0,1), ζm>0 and

    limmζm=limmγmζm=0.

    Then

    τm=γmτm1+(1γm)G(ζm,0)τmτF(G).

    Proof. Claim 1. As

    limmζm=limmγmζm=0,

    then we have limmγm=0. This shows that there exists a positive integer p, for all kN so that γm(0,c](0,1).

    From Theorem 3.3, limm||τmz|| exists for each zF(G).

    Claim 2. {G(ζm,0)τm} is bounded. From (2.1), we have

    ||G(ζm,0)τm}||=||11γmτmγm1γmτm1||11γm||τm||+γm1γm||τm1||1c||τm||+c1c||τm1||,

    which shows that {G(ζm,0)τm} is bounded.

    Claim 3. {τm}τ.

    As {τm} is bounded, take a sub-sequence {ωml} of {τm} such that ωmlτ. Let ωml=bl, γml=ρl and ζml=yl, lN. Let ζ>0 be fixed, then

    ||blG(ζ,0)τ||[ζyl]1a=0||G((a+1)yl,0)blG(ayl,0)bl||+||G([ζyl]yl,0)blG(ζylyl,0)τ||+||G(ζylyl,0)τG(ζ,0)||ζyl||G(yl,0)blbl||+||blτ||+||G(ζ[ζyl]yl,0)ττ||ζ||G(yl,0)blbl||yl+||blτ||+max0yyl||G(y,0)ττ||,  lN.

    Thus, we have

    lim supl||blG(ζ,0)τ||lim supl||blτ||.

    Therefore,

    G(ζ,0)τ=τF(G)

    by using Opial's property. By same method given in Theorem 3.3, we can prove that {τm}τ.

    This completes the proof.

    Theorem 3.5. Consider a real reflexive Banach space B with Opial's property and a subset D of B. Let G={G(a,0)} be a subfamily of E of strongly continuous nonexpansive mappings such that F(G). Take two sequences {γm} and {ζm} such that γm(0,1), ζm>0 and

    limmζm=limmγmζm=0.

    Then

    τm=γmτm1+(1γm)G(ζm,0)τmτF(G).

    Proof. Claim 1. For any zF(G), limm||τmz|| exists.

    Claim 2.

    ||G(ζm,0)τmτm||0  as  m. (3.2)

    As from Theorem 3.4, {G(ζm,0)τm} is bounded. Also, from (1.4), we have

    ||τmG(ζm,0)τm||=γm||τm1G(ζm,0)τm||0  as  m.

    Therefore,

    ||G(ζm,0)τmτm||0  as  m.

    Claim 3. For any ζ>0,

    limm||G(ζm,0)τmτm||=0.

    In fact, we have

    ||τmG(ζm,0)τm||ζζm1b=0||G((b+1)ζm,0)τmG(bζm,0)τm||+||G((ζζm)ζm,0)τmG(ζ,0)τm||ζζm||G(ζm,0)τmτm||+||G((ζζζm)ζm,0)τmτm||ζγmζm||τm1G(ζm,0)||+maxs[0,ζm]{||G(v,0)τmτm||},  mN.

    Thus, from this equation and Eq (3.2), we get

    limm||G(ζm,0)τmτm||=0.

    Claim 4. Now, we will show that {τm}τF(G).

    Since {τm} is bounded, it must have a convergent sub-sequence {μmk} such that μmkτ. From Claim 3, we have

    ||τG(ζ,0)τ||=limk||μmkG(ζ,0)μmk||=0.

    Thus, τF(G). Hence, we have

    limm||τmτ||=limk||μmkτ||=0.

    This completes the proof.

    Example 4.1. Consider the Hilbert space H=L2([0,π],C) and let T={T(a);a0} be a semigroup such that

    (T(a)u)(t)=2πm=1eam2wm(u)sinmt,t[0,π], a0.

    Here,

    wm(u)=π0k(a)sin(ma)ds.

    Surely, it is nonexpansive and strongly continuous semigroup in this Hilbert space. The linear operator Λ generates this semigroup such that Λu=¨u. Let for all kH, the set M(Λ) represent the maximal domain of Λ such that u and ¨u must be continuous. Also, u(0)=0=u(π). Now, consider the non-autonomous Cauchy problem:

    {h(t,ε)t =g(t)2h(t,ε)2ε,  t>0, 0επ,h(0,ε)=b(ε),h(t,0)=h(t,π)=0, t0,

    where b(.)H and g: R+[1,) are nonexpansive functions on R+. This function g is periodic, i.e., g(j+p)=g(j) for every jR+ and for some p1. Take the function

    K(t)=t0g(t)dt,

    then the property of evolution equations will be satisfied by the solution k(.) of the above non-autonomous Cauchy problem. Therefore,

    k(t)=A(t,h)k(h),

    where

    A(t,h)=T(K(t)K(h)),

    see Example 2.9b [35].

    As the function tert||h(t)|| is bounded for any r0 on the set of non-negative real numbers, we have

    0||A(t,0)u||2dt=2π0r=1wr2(u)e2r2K(t)dt=2πr=1wr2(u)0e2r2K(t)dt=||u||220e2r2K(t)dt||u||220e2K(t)dt.

    On the other side, we have

    0e2K(t)dt=b=0(b+1)cbce2K(t)dt=b=0c0e2K(bc+β)dβ=b=0e2bK(c)c0e2K(β)dβcb=0e2bK(c)=ce2K(c)e2K(c)1=W.

    Therefore, we have

    0||A(t,0)u||2dtW||u||22.

    By using Theorem 3.2 from [36], we have a(A)12C, where a(A) is the growth bound of the family A and C1. For more details, see [36].

    This shows that the evolution family on the Hilbert space H is nonexpansive, so Theorem 3.5 can be applied to such evolution families and will be helpful in finding its solution and uniqueness.

    Example 4.2. Let

    E(t,s)=t+1s+1

    be an evolution family on the space l3, then clearly the space l3 is not a Hilbert space, but it is reflexive. If we take its subfamily G(t,0)=t+1 then we still can apply our results to this subfamily. Let γm=1m2 and ζm=1m, then clearly

    limmγmζm=0,

    so by Theorem 3.5 we have the sequence of iteration

    τm=1m2τm1+(11m2)G(1m,0)τm0F(G),

    where 0 is the unique fixed point of the subfamily G.

    Open problem. We have an open problem for the readers that whether Lemmas 3.1 and 3.2 and Theorem 3.5 can be generalized to all periodic and non-periodic evolution families?

    The idea of semigroupos arise from the solution of autonomous abstract Cauchy problem while the idea of evolution family arise from the solution of non-autonomous abstrct Cauchy problem, which is more genreal than the semigroups. In [33], the strong convergence theorms for fixed points for nonexpansive semigroups on Hilbert spaces are proved. We generalized the results to a subfamily of an evolution family on a Hilbert space. These results may be come a gateway for many researchers to extends these ideas to the whole evolution family rather than the subfamily in future. Also these results are helpfull for the mathematician and others to use for existence and uniqeness of solution of non-autonomous abstarct Cauchy problems.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work grant code: 23UQU4331214DSR003.

    The authors declare that they have no conflicts of interest.



    [1] S. A. Kauffman, Metabolic stability and epigenesis in randomly constructed genetic nets, J. Theor. Biol., 22 (1969), 437–467. https://doi.org/10.1016/0022-5193(69)90015-0 doi: 10.1016/0022-5193(69)90015-0
    [2] Z. Liu, Y. Wang, H. Li, New approach to derivative calculation of multi-valued logical functions with application to fault detection of digital circuits, IET Control Theory Appl., 8 (2014), 554–560. https://doi.org/10.1049/iet-cta.2013.0104 doi: 10.1049/iet-cta.2013.0104
    [3] C. M. Files, M. A. Perkowski, Multi-valued functional decomposition as a machine learning method, Proceedings of the 28th International Symposium on Multiple-Valued Logic, (1998), 173–178. https://doi.org/10.1109/ISMVL.1998.679331 doi: 10.1109/ISMVL.1998.679331
    [4] D. Cheng, Semi-tensor product of matrices and its application to Morgan's problem, Sci. China Ser. Inf. Sci., 44 (2001), 195–212. https://doi.org/10.1007/BF02714570 doi: 10.1007/BF02714570
    [5] D. Cheng, H. Qi, A linear representation of dynamics of Boolean networks, IEEE Trans. Autom. Control, 55 (2010), 2251–2258. https://doi.org/10.1109/TAC.2010.2043294 doi: 10.1109/TAC.2010.2043294
    [6] X. Zhao, S. Fu, Trajectory tracking approach to logical (control) networks, AIMS Mathematics, 7 (2022), 9668–9682. https://doi.org/10.3934/math.2022538 doi: 10.3934/math.2022538
    [7] Q. Zhang, J. Feng, P. Zhao, Controllability of Markovian jump Boolean control networks: A graphical approach, Neurocomputing, 498 (2022), 89–97. https://doi.org/10.1016/j.neucom.2022.04.119 doi: 10.1016/j.neucom.2022.04.119
    [8] F. Li, Y. Tang, Pinning controllability for a Boolean network with arbitrary disturbance inputs, IEEE Trans. Cybern., 51 (2021), 3338–3347. https://doi.org/10.1109/TCYB.2019.2930734 doi: 10.1109/TCYB.2019.2930734
    [9] Y. Zhao, Y. Liu, Output controllability and observability of mix-valued logic control networks, Mathematical Modelling and Control, 1 (2021), 145–156. https://doi.org/10.3934/mmc.2021013 doi: 10.3934/mmc.2021013
    [10] Y. Guo, Y. Wu, W. Gui, Stability of discrete-time systems under restricted switching via logic dynamical generator and STP-based mergence of hybrid states, IEEE Trans. Autom. Control, 67 (2022), 3472–3483. https://doi.org/10.1109/TAC.2021.3105319 doi: 10.1109/TAC.2021.3105319
    [11] H. Li, X. Ding, A control Lyapunov function approach to feedback stabilization of logical control networks, SIAM J. Control Optim., 57 (2019), 810–831. https://doi.org/10.1137/18M1170443 doi: 10.1137/18M1170443
    [12] Y. Zhang, J. Zhong, W. Xiong, J. Cao, Stabilization and oscillations design for a family of cyclic Boolean networks via nodes connection, Neurocomputing, 369 (2019), 61–68. https://doi.org/10.1016/j.neucom.2019.08.062 doi: 10.1016/j.neucom.2019.08.062
    [13] L. Lin, J. Zhong, S. Zhu, J. Lu, Sampled-data general partial synchronization of Boolean control networks, J. Franklin Inst., 359 (2022), 1–11. https://doi.org/10.1016/j.jfranklin.2020.08.047 doi: 10.1016/j.jfranklin.2020.08.047
    [14] Y. Li, H. Li, P. Duan, Synchronization of switched logical control networks via event-triggered control, J. Franklin Inst., 355 (2018), 5203–5216. https://doi.org/10.1016/j.jfranklin.2018.04.028 doi: 10.1016/j.jfranklin.2018.04.028
    [15] J. Feng, Y. Li, S. Fu, H. Lyu, New method for disturbance decoupling of Boolean networks, IEEE Trans. Autom. Control, 67 (2022), 4794–4800. https://doi.org/10.1109/TAC.2022.3161609 doi: 10.1109/TAC.2022.3161609
    [16] Y. Li, J. Zhu, Necessary and sufficient vertex partition conditions for input-output decoupling of Boolean control networks, Automatica, 137 (2022), 110097. https://doi.org/10.1016/j.automatica.2021.110097 doi: 10.1016/j.automatica.2021.110097
    [17] Y. Wang, H. Li, Output trackability of Boolean control networks via ledley antecedence solution, IEEE Trans. Circuits Syst. Ⅱ, Exp. Briefs, 69 (2022), 1183–1187. https://doi.org/10.1109/TCSII.2021.3095487 doi: 10.1109/TCSII.2021.3095487
    [18] Y. Guo, P. Wang, W. Gui, C. Yang, Set stability and set stabilization of Boolean control networks based on invariant subsets, Automatica, 61 (2015), 106–112. https://doi.org/10.1016/j.automatica.2015.08.006 doi: 10.1016/j.automatica.2015.08.006
    [19] Y. Li, H. Li, W. Sun, Event-triggered control for robust set stabilization of logical control networks, Automatica, 95 (2018), 556–560. https://doi.org/10.1016/j.automatica.2018.06.030 doi: 10.1016/j.automatica.2018.06.030
    [20] H. Li, X. Ding, Finite-time time-variant feedback stabilization of logical control networks with Markov jump disturbances, IEEE Trans. Circuits Syst. Ⅱ, Exp. Briefs, 67 (2020), 2079–2083. https://doi.org/10.1109/TCSII.2019.2949558 doi: 10.1109/TCSII.2019.2949558
    [21] Y. Ding, Y. Guo, Y. Xie, C. Yang, W. Gui, Time-optimal state feedback stabilization of switched Boolean control networks, Neurocomputing, 237 (2017), 265–271. https://doi.org/10.1016/j.neucom.2016.12.044 doi: 10.1016/j.neucom.2016.12.044
    [22] J. Lu, J. Zhong, C. Huang, J. Cao, On pinning controllability of Boolean control networks, IEEE Trans. Autom. Control, 61 (2016), 1658–1663. https://doi.org/10.1109/TAC.2015.2478123 doi: 10.1109/TAC.2015.2478123
    [23] Y. Li, J. Feng, X. Li, S. Xu, Pinning controller design for set reachability of state-dependent impulsive Boolean networks, IEEE Trans. Neural Netw. Learn. Syst., (2022), 35536802. https://doi.org/10.1109/TNNLS.2022.3171576 doi: 10.1109/TNNLS.2022.3171576
    [24] H. Li, P. Song, Q. Yang, Pinning control design for robust output tracking of k-valued logical networks, J. Franklin Inst., 354 (2017), 3039–3053. https://doi.org/10.1016/j.jfranklin.2017.02.009 doi: 10.1016/j.jfranklin.2017.02.009
    [25] Y. Liu, B. Li, J. Lu, J. Cao, Pinning control for the disturbance decoupling problem of Boolean networks, IEEE Trans. Autom. Control, 62 (2017), 6595–6601. https://doi.org/10.1109/TAC.2017.2715181 doi: 10.1109/TAC.2017.2715181
    [26] F. Li, H. Li, L. Xie, Q. Zhou, On stabilization and set stabilization of multivalued logical systems, Automatica, 80 (2017), 41–47. https://doi.org/10.1016/j.automatica.2017.01.032 doi: 10.1016/j.automatica.2017.01.032
    [27] S. Zhu, J. Lu, L. Sun, J. Cao, Distributed pinning set stabilization of large-scale Boolean networks, IEEE Trans. Autom. Control, https://doi.org/10.1109/TAC.2022.3169178 doi: 10.1109/TAC.2022.3169178
    [28] D. Cheng, H. Qi, Z. Li, Analysis and Control of Boolean Networks: A Semi-tensor Product Approach, London: Springer, 2011.
    [29] D. Cheng, Disturbance decoupling of Boolean control networks, IEEE Trans. Autom. Control. 56 (2011), 2–10. https://doi.org/10.1109/TAC.2010.2050161 doi: 10.1109/TAC.2010.2050161
    [30] Z. Li, D. Cheng, Algebraic approach to dynamics of multivalued networks, Int. J. Bifurcat. Chaos, 20 (2010), 561–582. https://doi.org/10.1142/S0218127410025892 doi: 10.1142/S0218127410025892
    [31] D. Cheng, H. Qi, Y. Zhao, An Introduction to Semi-tensor Product of Matrices and Its Applications, Singapore: World Scientific, 2012.
    [32] D. Cheng, Z. Liu, H. Qi, Completeness and normal form of multi-valued logical functions, J. Franklin Inst., 357 (2020), 9871–9884. https://doi.org/10.1016/j.jfranklin.2020.06.026 doi: 10.1016/j.jfranklin.2020.06.026
    [33] A. Veliz-Cuba, D. Murrugarra, R. Laubenbacher, Structure and dynamics of acyclic networks, Discret. Event Dyn. Syst.-Theory Appl., 24 (2014), 647–658. https://doi.org/10.1007/s10626-013-0174-2 doi: 10.1007/s10626-013-0174-2
    [34] J. Bang-Jensen, G. Gutin, Digraphs: Theory, Algorithms and Applications, New York: Springer, 2008.
    [35] G. Even, J. Naor, B. Schieber, M. Sudan, Approximating minimum feedback sets and multicuts in directed graphs, Algorithmica, 20 (1998), 151–174. https://doi.org/10.1007/PL00009191 doi: 10.1007/PL00009191
    [36] Y. Wang, T. Liu, D. Cheng, Some notes on semi-tensor product of matrices and swap matrix, Journal of Systems Science and Mathematical Sciences, 36 (2016), 1367–1375. https://doi.org/10.12341/jssms12892 doi: 10.12341/jssms12892
    [37] C. Campbell, R. Albert, Stabilization of perturbed Boolean network attractors through compensatory interactions, BMC Syst. Biol., 8 (2014), 53. https://org/10.1186/1752-0509-8-53 doi: 10.1186/1752-0509-8-53
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2203) PDF downloads(123) Cited by(13)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog