Skip to main content
Springer logoLink to Springer
. 2018 Apr 3;2018(1):123. doi: 10.1186/s13662-018-1569-z

Approximation of state variables for discrete-time stochastic genetic regulatory networks with leakage, distributed, and probabilistic measurement delays: a robust stability problem

S Pandiselvi 1, R Raja 2, Jinde Cao 3,, G Rajchakit 4, Bashir Ahmad 5
PMCID: PMC5882887  PMID: 29628952

Abstract

This work predominantly labels the problem of approximation of state variables for discrete-time stochastic genetic regulatory networks with leakage, distributed, and probabilistic measurement delays. Here we design a linear estimator in such a way that the absorption of mRNA and protein can be approximated via known measurement outputs. By utilizing a Lyapunov–Krasovskii functional and some stochastic analysis execution, we obtain the stability formula of the estimation error systems in the structure of linear matrix inequalities under which the estimation error dynamics is robustly exponentially stable. Further, the obtained conditions (in the form of LMIs) can be effortlessly solved by some available software packages. Moreover, the specific expression of the desired estimator is also shown in the main section. Finally, two mathematical illustrative examples are accorded to show the advantage of the proposed conceptual results.

Keywords: Genetic regulatory networks (GRNs), Time-varying delays, Distributed delays, Leakage delays, Probabilistic measurement delays

Introduction and system formulation

A gene is a physical structure made up of DNA, and most of the genes hold the data which is required to make molecules called as proteins. In the modern years, research in genetic regulatory networks (GRNs) has gained significance in both biological and bio-medical sciences, and a huge number of tremendous results have been issued. Distinct kinds of computational models have been applied to propagate the behaviors of GRNs; see, for instance, the Bayesian network models, the Petri net models, the Boolean models, and the differential equation models. Surrounded by the indicated models, the differential equation models describe the rate of change in the concentration of gene production, such as mRNAs and proteins, as constant values, whereas the other models do not have such a basis.

As one of the mostly investigated dynamical behaviors, the state estimation for GRNs has newly stirred increasing research interest (see [1, 2] and the references cited therein [1, 310]). In fact, this is an immense concern since GRNs are complex nonlinear systems. Due to the complication, it is frequently the case that only partial facts around the states of the nodes are accessible in the network outputs. In consideration of realizing the GRNs better, there has been a necessity to estimate the state of the nodes through securable measurements. In [1], the robust H problem was considered for a discrete-time stochastic GRNs with probabilistic measurement delays. In [2], the robust H state estimation problem was investigated for a general class of uncertain discrete-time stochastic neural networks with probabilistic measurement delays. By designing an adaptive controller, the authors investigated the problem of delayed GRNs stabilization in [7]. Xiao et al. discussed the stability, periodic oscillation, and bifurcation of two-gene regulatory networks with time delays [8]. The stability of continuous GRNs and discrete-time GRNs was discussed, respectively, in [11]. Huang et al. considered the bifurcation of delayed fractional GRNs by hybrid control [12].

Due to the limited signal communication speed, the measurement among the networks is always assumed to be a delayed one. So, the network measurement could not include instruction about the present gene states, while the delayed network measurement could. The most fashionable mechanism to relate the probabilistic measurement delay or some other kind of lacking measurement is to grab it as a Bernoulli distributed white classification [1320]. The robust stochastic stability of stochastic genetic GRNs was considered, and some delay-dependent criteria were presented in the form of LMIs [18]. And the asymptotic stability of delayed stochastic GRNs with impulsive effect was discussed in [19]. The synchronization problem of dynamical system was also discussed in [21, 22]. The challenging task is how to draft the robust estimators when both uncertainties and probabilistic appeared in discrete-time GRN models.

More recently, in [23], Liu et al. developed a state estimation problem for a genetic regulatory network with Markovian jumping parameters and time delays:

m˙(t)=A(r(t))m(t)+W(r(t))g(p(tσ(t))),p˙(t)=C(r(t))p(t)+D(r(t))m(tτ(t)).

Also in [24], Wan et al. proposed the state estimation of discrete-time GRN with random delays governed by the following equation:

M(k+1)=AM(k)+Bf(P(kd(k)))+V,P(k+1)=CP(k)+DM(kτ(k)).

Considering the above referenced papers, the robustness of approximation of the stochastic GRNs with leakage delays, distributed delays, and probabilistic measurement delays has not been tackled. The main contributions of this paper are summarized as follows:

  1. We examine the approximation concern for the discrete-time stochastic GRNs with the leakage delays, distributed delays, and probabilistic measurement delays into the problem and model the robust H state estimator for a class of discrete-time stochastic GRNs. Here, the probabilistic measurement delays, which narrate the binary shifting sequence, are satisfied by the conditional probability distribution. So, the crisis of parameter uncertainties, including errors, stochastic disturbance, leakage delays, distributed delays, and the activation function of the addressed GRNs, is identified by sector-bounded nonlinearities.

  2. By applying the Lyapunov stability theory and stochastic analysis techniques, sufficient conditions are first entrenched to assure the presence of the desired estimators in terms of a linear matrix inequality (LMI). These circumstances are reliant on both the lower and upper bounds of time-varying delays. Again, the absolute expression of the desired estimator is demonstrated to assure the estimation error dynamics to be robustly exponentially stable in the mean square for the consigned system.

  3. Finally, twin mathematical examples beside with simulations are given to view the capability of the advanced criteria.

In this note, we consider the GRNs with leakage, discrete, and distributed delays described as follows:

x(k+1)=(A+ΔA(k))x(kρ1)+(B+ΔB(k))gˆ(y(kδ(k)))+(E+ΔE(k))s=1μsh(y(ks))+σ(k,x(kρ1))ω(k)+Lxvx(k),y(k+1)=(C+ΔC(k))y(kρ2)+(D+ΔD(k))x(kτ(k))+(F+ΔF(k))n=1ξnx(kn)+Lyvy(k), 1

where x(kρ1)=[x1(kρ1),,xn(kρ2)]TRn, y(kρ2)=[y1(kρ2),,yn(kρ2)]TRn, xi(kρ1), and yi(kρ2) (i=1,2,,n) denote the concentrations of mRNA and protein of the ith node at time t, respectively; A=diag{a1,a2,,an}, C=diag{c1,c2,,cn}, and D=diag{d1,d2,,dn} are constant matrices; ai>0, ci>0, and di>0 are the degradation rates of mRNAs, protein, and the translation rate of the ith gene, respectively; the coupling matrix of the genetic regulatory network is defined as B=(bij)Rn×n; E=diag{e1,e2,,en}, and F=diag{f1,f2,,fn} are the weight matrices. ΔA(k), ΔB(k), ΔC(k), ΔD(k), ΔE(k), and ΔF(k) represent the parameter uncertainties; h(y(k))=[h1(y(k)),,hn(y(k))]TRn denotes the activation function; the exogenous disturbance signals vx(k),vy(k)Rn satisfy vi()L2[0,). Lx and Ly are the known real constant matrices. δ(k) denotes the feedback regulation delay and τ(k) denotes the translation delay, which satisfy

0δmδ(k)δM,0τmτ(k)τM, 2

where the lower bound δm, τm and the upper bound δM, τM are known positive integers.

Furthermore, the nonlinear activation function gˆ(y(kδ(k)))=[gˆ1(y1(kδ(k))),,gˆn(yn(kδ(k)))]TRn represents the feedback regulation of the protein on the transcription. It is a monotonic function in the Hill form, that is, gˆi(f)=fhj1+fhj (j=1,2,,n), where hj is the Hill co-efficient and f is a positive constant. The noise intensity function vector σ(k,x(k)):R×RnRn satisfies

σT(k,x(kρ1))σ(k,x(kρ1))xT(kρ1)Hx(kρ1), 3

where H>0 is a known matrix. ω(k) is a Brownian motion with E{ω(k)}=0, E{ω2(k)}=1 and E{ω(i)ω(j)}=0 (ij).

For large-scale complex networks, information around the network nodes is not often fully attainable from the network outputs (see [25, 26]). We can assume that network measurements are described as follows:

Zx(k)=Mx(k),Zy(k)=Ny(k), 4

where M and N are known constant matrices. Zx(k),Zy(k)Rl are the complete outputs of the network. The network outputs are subjected to probabilistic delays that can be described by

Z˜x(k)=αkZx(k)+(1αk)Zx(k1),Z˜y(k)=βkZy(k)+(1βk)Zy(k1), 5

where the stochastic variables αk,βkR are Bernoulli allocated with sequences directed by

Prob{αk=1}=E{αk}=α0,Prob{αk=0}=1E{αk}=1α0,Prob{βk=1}=E{βk}=β0,Prob{βk=0}=1E{βk}=1β0. 6

Here α0,β0>0 are known constants. Obviously, for αk, βk, the variance σα=α0(1α0), σβ=β0(1β0).

The GRN state estimator to be designed is given as follows:

{xˆ(k+1)=Axxˆ(k)+BxZ˜x(k),yˆ(k+1)=Ayyˆ(k)+ByZ˜y(k), 7

where xˆ(k),yˆ(k)Rn are the estimations of x(k) and y(k), and Ax, Ay, Bx, By are the estimator gain matrices to be determined.

Assume that the estimation error vectors are x˜(k)=x(k)xˆ(k) and y˜(k)=y(k)yˆ(k); the estimation error dynamics can be defined as follows from equations (1), (5), and (7):

x˜(k+1)=(A+ΔA(k))x(kρ1)+(AxαkBxM)x(k)+(B+ΔB(k))gˆ(y(kδ(k)))+(E+ΔE(k))s=1μsh(y(ks))+σ(k,x(kρ1))ω(k)Axx˜(k)(1αk)BxMx(k1)+Lxvx(k),y˜(k+1)=(C+ΔC(k))y(kρ2)+(AyβkByN)y(k)+(D+ΔD(k))x(kτ(k))+(F+ΔF(k))n=1ξnx((kn))Ayy˜(k)(1βk)ByNy(k1)+Lyvy(k). 8

For suitability, we denote

x¯(k)=[x(k)x˜(k)],y¯(k)=[y(k)y˜(k)],x¯(j)=ψ(j),j=τM,τM+1,,1,0,y¯(j)=φ(j),j=δM,δM+1,,1,0,

where ψ(j), j=τM,τM+1,,1,0 and φ(j), j=δM,δM+1,,1,0 are the initial conditions.

Preliminaries

Notations: Throughout the paper, naturals+ refers to the position for the set of nonnegative integers; Rn indicates the n-dimensional Euclidean space. The superscript “T” acts as the matrix transposition. The code XY (each X>Y), where X and Y are symmetric matrices, means that XY is positive semi-definitive (respectively positive definite). I means the identity matrix with consistent dimension. The symbol “∗” denotes the term symmetry. In addition, E{} denotes the expectation operator. L2[0,) is the amplitude of square-integrable vector functions over [0,). || denotes the Euclidean vector norm. Matrices, if not absolutely specified, are affected to have compatible dimensions.

Assumption 1

The parameter uncertainties ΔA(k), ΔB(k), ΔC(k), ΔD(k), ΔE(k), ΔF(k) are of the following form.

The admissible parameter uncertainties are assumed to be of the form:

[ΔA(k)ΔB(k)ΔC(k)ΔD(k)ΔE(k)ΔF(k)]=RN(k)[W1W2W3W4W5W6],

where R, Wi (i=1,2,,6) are the known constant matrices with appropriate dimensions. The uncertain matrix N(k) satisfies NT(k)N(k)I, knaturals+.

Assumption 2

The vector-valued function gˆi() is assumed to satisfy the following sector-bounded condition, namely for x,yRn:

[gˆ(x)gˆ(y)N1(xy)]T[gˆ(x)gˆ(y)N2(xy)]0,

where N1, N2 are known real constant matrices, and N˜=N1N2 is a symmetric positive definite matrix.

Definition 2.1

If there exist constants α>0 and 0<μ<1, system (8) with vx(k)=0 and vy(k)=0 is global robust exponential state estimator of GRNs (1) with measurements (5) in the mean square sense such that

E{|x¯(k)|2+|y¯(k)|2}αμk(maxτMk0|x¯(k)|2+maxδMk0|y¯(k)|2).

Definition 2.2

If there exists a scalar γ>0, system (8) is a robust H state estimator of GRNs (1) with measurements (5) in the mean square sense with zero initial conditions such that

Ek=0{|x¯(k)|2+|y¯(k)|2}γ2Ek=0(|vx(k)|2+|vy(k)|2)

for all non-zero vx(k),vy(k)L2[0,).

The following lemmas are crucial in implementing our main results.

Lemma 2.3

(see [2, 26])

Let N and S be real constant matrices; matrix F(k) satisfies FT(k)F(k)1. Then we have:

  • (i)

    For any ϵ>0, NF(k)S+STFT(k)NTϵ1NNT+ϵSTS.

  • (ii)

    For any P>0, ±2xTyxTP1x+yTPy.

Lemma 2.4

Given the constant matrices Ωˆ1, Ωˆ2, and Ωˆ3, where Ωˆ1T=Ωˆ1 and Ωˆ2T=Ωˆ2>0, then Ωˆ1+Ωˆ3TΩˆ21Ωˆ3<0, if and only if

[Ωˆ1Ωˆ3TΩˆ3Ωˆ2]<0or[Ωˆ2Ωˆ3Ωˆ3TΩˆ1]<0.

Lemma 2.5

Let MRn×n be a positive semi-definite matrix, xiRn, and ai0 (i=1,2,). If the series distressed are convergent, the following inequality holds:

(i=1+aixi)TM(i=1+aixi)(i=1+ai)i=1+aixiTMxi.

Remark 2.1

In [1] Wang et al. investigated the robust state estimation for stochastic genetic regulatory networks with probabilistic delays in discrete sense, and Lv et al. [4] developed the robust distributed state estimation for genetic regulatory networks with Markovian jumping parameters. However, the inclusion of discrete-interval GRNs with leakage delays, probabilistic measurement delays, noise, and distributed delays has not been taken into account. So, the prime intention of this work is to elucidate that the state estimation problem for the improved system (8) with leakage delays is robustly exponentially stable.

Exponential stability criterion

In this part, we first introduce a sufficient condition under which the augmented system (8) is robustly mean-square exponentially stable with the exogenous disturbance signals vx(k)=0 and vy(k)=0.

Theorem 3.1

Suppose that Assumptions 1 and 2 hold. Let the leakage delays ρ1, ρ2 and the estimation parameters Ax, Bx, Ay, and By be given and also the acceptable conditions hold. Then the estimation error system (8) with vx(k)=0 and vy(k)=0 is robustly exponentially stable in the mean square if there exist positive definite matrices R11, R12, R21, R22, R31, R32, R41, R42, R51, R52 and three positive constant scalars λ, ε1, and ε2 such that the following LMI holds:

Λ1=[Λ11S1J10T¯1Tε1I]<0,Λ2=[Λ22S2J20T¯2Tε2I]<0, 9

where

Λ11=[ψ110000000R210000000R310000000R41+ε1W4TW40000000HR110000000I(R12+R22)0000000ξ¯R52],Λ22=[ψ12000000000R22000000000R32000000000R42λN˜1+ε2W2TW2λN˜2T0000000λN˜2λI0000000000000000000I(R11+R21)000000000μ¯R51000000000μ¯R51],S1=[0000Ξ¯1500Ξ212R21AxΞ230000σαR21BxM0σαR21BxM0000000Ξ¯4400000000Ξ¯550],

where

Ξ¯15=2(R11+R21)A;Ξ¯44=2(R12+R22)D;Ξ¯55=2(R12+R22)F;Ξ21=2R21(Axα0BxM);Ξ23=2R21(1α0)BxM;S2=[00000Θ¯16000Θ212R22AyΘ23000000σβR22ByN0σβR22ByN0000000000Θ¯450000000000Θ¯5700],

where

Θ¯16=2(R12+R22)C;Θ¯45=2(R11+R21)B;Θ¯57=2(R11+R21)E;Θ21=2R22(Ayβ0ByN);Θ23=2R22(1β0)ByN,J1=diag{(R11+R21),R21,R21,(R12+R22),(R12+R22)},J2=diag{(R12+R22),R22,R22,(R11+R21),(R11+R21)},T1¯=[00002(R11+R21)T00000000000000000002(R12+R22)T000000002(R12+R22)T0],T2¯=[000002(R12+R22)T00000000000000000000000002(R11+R21)T00000000002(R11+R21)T00],μ¯=s=1μs,ξ¯=n=1ξn,ψ11=R11+R31+(τMτm+1)R41+ξ¯R52;ψ12=R12+R32+(δMδm+1)R42,N˜1=(N1TN2+N2TN1)2;N˜2=(N1T+N2T)2.

Proof

Choose a Lyapunov–Krasovskii functional for the augmented system (8):

V(k)=V1(k)+V2(k)+V3(k)+V4(k)+V5(k)+V6(k), 10

where

V1(k)=xT(k)R11x(k)+yT(k)R12y(k),V2(k)=x˜T(k)R21x˜(k)+y˜T(k)R22y˜(k),V3(k)=xT(k1)R31x(k1)+yT(k1)R32y(k1),V4(k)=i=kτ(k)k1xT(i)R41x(i)+i=kδ(k)k1yT(i)R42y(i),V5(k)=j=τM+1τmi=k+jk1xT(i)R41x(i)+j=δM+1δmi=k+jk1yT(i)R42y(i),V6(k)=i=1μij=kik1hT(y(j))R51h(y(j))+i=1ξij=kik1xT(i)R52x(i).

Calculate the difference of Vi(k) (i=1,2,,6) along the trajectories of model (8) with vx(k)=0, vy(k)=0 and

E{ΔV(k)}=i=16E{Vi(k)}. 11

Now, we have

E{ΔV1(k)}=E{V1(k+1)V1(k)}E{ΔV1(k)}=E{[(A+ΔA(k))x(kρ1)+(B+ΔB(k))gˆ(y(kδ(k)))E{ΔV1(k)}=+(E+ΔE(k))s=1μsh(y(ks))]TE{ΔV1(k)}=×R11[(A+ΔA(k))x(kρ1)+(B+ΔB(k))gˆ(y(kδ(k))E{ΔV1(k)}=+(E+ΔE(k))s=1μsh(y(ks))]E{ΔV1(k)}=+σT(k,x(kρ1))R11σ(k,x(kρ1))xT(k)R11x(k)yT(k)R12y(k)E{ΔV1(k)}=+[(C+ΔC(k))y(kρ2)+(D+ΔD(k))x(kτ(k))E{ΔV1(k)}=+(F+ΔF(k))n=1ξnx(kn)]TE{ΔV1(k)}=×R12[(C+ΔC(k))y(kρ2)+(D+ΔD(k))x(kτ(k))E{ΔV1(k)}=+(F+ΔF(k))n=1ξnx(kn)]}, 12
E{ΔV2(k)}=E{V2(k+1)V2(k)}E{ΔV2(k)}=E{[(A+ΔA(k))x(kρ1)+(AxαkBxM)x(k)E{ΔV2(k)}=+(B+ΔB(k))gˆ(y(kδ(k)))+(E+ΔE(k))s=1μsh(y(ks))E{ΔV2(k)}=Axx˜(k)(1αk)BxMx(k1)]TE{ΔV2(k)}=×R21[(A+ΔA(k))x(kρ1)+(AxαkBxM)x(k)E{ΔV2(k)}=+(B+ΔB(k))gˆ(y(kδ(k)))+(E+ΔE(k))s=1μsh(y(ks))E{ΔV2(k)}=Axx˜(k)(1αk)BxMx(k1)]E{ΔV2(k)}=+σα[BxMx(k)+BxMx(k1)]TR21[BxMx(k)+BxMx(k1)]E{ΔV2(k)}=x˜T(k)R21x˜(k)+[(C+ΔC(k))y(kρ2)+(AyβkByN)y(k)E{ΔV2(k)}=+(D+ΔD(k))x(kτ(k))+(F+ΔF(k))n=1ξnx((kn))E{ΔV2(k)}=Ayy˜(k)(1βk)ByNy(k1)]TE{ΔV2(k)}=×R22[(C+ΔC(k))y(kρ2)+(AyβkByN)y(k)E{ΔV2(k)}=+(D+ΔD(k))x(kτ(k))+(F+ΔF(k))n=1ξnx((kn))E{ΔV2(k)}=Ayy˜(k)(1βk)ByNy(k1)]E{ΔV2(k)}=+σβ[ByNy(k)+ByNy(k1)]TR22[ByNy(k)+ByNy(k1)]E{ΔV2(k)}=y˜T(k)R22y˜(k)}, 13
E{ΔV3(k)}=E{V3(k+1)V3(k)}=E{xT(k)R31x(k)xT(k1)R31x(k1)+yT(k)R32y(k)yT(k1)R32y(k1)}, 14
E{ΔV4(k)}=E{V4(k+1)V4(k)}E{xT(k)R41x(k)xT(kτ(k))R41x(kτ(k))+i=kτM+1kτmxT(i)R41x(i)+yT(k)R42y(k)yT(kδ(k))R42y(kδ(k))+i=kδM+1kδmyT(i)R42y(i)}, 15
E{ΔV5(k)}=E{V5(k+1)V5(k)}=E{(τMτm)xT(k)R41x(k)i=kτM+1kτmxT(i)R41x(i)+(δMδm)yT(k)R42y(k)i=kδM+1kδmyT(i)R42y(i)},E{ΔV6(k)}=E{V6(k+1)V6(k)}=i=1μij=k+1ik+11hT(y(j))R51h(y(j))+i=1ξij=k+1ik+11xT(i)R52x(i)i=1μij=kik1hT(y(j))R51h(y(j))i=1ξij=kik1xT(i)R52x(i)=i=1μi[hT(y(k))R51h(y(k))hT(y(ki))R51h(y(ki))]+i=1ξi[xT(k)R52x(k)xT(ki)R52x(ki)]. 16

Using Lemma 2.5, we get

E{ΔV6(k)}μ¯hT(y(k))R51h(y(k))μ¯[μ¯h(y(ks))]TR51[μ¯h(y(ks))]+ξ¯xT(k)R52x(k)ξ¯[ξ¯x(kn)]TR52[ξ¯x(kn)]. 17

Substituting equations (12)–(17) into equation (11) results in

E{ΔV(k)}E{ϖ0T(k)[Λ11+σαWˆ01TR21Wˆ01+2Gˆ01T(k)(R11+R21)Gˆ01(k)+2Fˆ01T(k)R21Fˆ01(k)+2Gˆ11T(k)(R12+R22)Gˆ11(k)+2Sˆ01T(k)(R12+R22)Sˆ01(k)]ϖ0(k)+Γ0T(k)[Λ12+σβWˆ02TR22Wˆ02+2Gˆ02T(k)(R12+R22)Gˆ02(k)+2Fˆ02T(k)R22Fˆ02(k)+2Gˆ12T(k)(R11+R21)Gˆ12(k)+2Sˆ02T(k)(R11+R21)Sˆ02(k)]Γ0(k)}, 18

where

ϖ0(k)=[xT(k),x˜T(k),xT(k1),xT(kτ(k)),xT(kρ1),xT(kn),[ξ¯x(kn)]T],Γ0(k)=[yT(k),y˜T(k),yT(k1),yT(kδ(k)),gT(y(kδ(k))),yT(kρ2),hT(y(ks)),hT(k),[μ¯h(y(ks))]T],

where

Λ11=[ψ110000000R210000000R310000000R410000000HR110000000I(R12+R22)0000000ξ¯R52],Λ12=[ψ12000000000R22000000000R32000000000R4200000000000000000000000000000I(R11+R21)000000000μ¯R51000000000μ¯R51],ψ11=R11+R31+(τMτm+1)R41+ξ¯R52;ψ12=R12+R32+(δMδm+1)R42,Wˆ01=[BxM,0,BxM,0,0,0,0];Wˆ02=[ByN,0,ByN,0,0,0,0,0,0],Gˆ01(k)=[0,0,0,0,(A+ΔA(k)),0,0];Gˆ02(k)=[0,0,0,0,0,(C+ΔC(k)),0,0,0],Fˆ01(k)=[Axα0BxM,Ax,(1α0)BxM,0,0,0,0];Fˆ02(k)=[Ayβ0ByN,Ay,(1β0)ByN,0,0,0,0,0,0],Gˆ11(k)=[0,0,0,(D+ΔD(k)),0,0,0];Gˆ12(k)=[0,0,0,0,(B+ΔB(k)),0,0,0,0],Sˆ01(k)=[0,0,0,0,0,(F+ΔF(k)),0];Sˆ02(k)=[0,0,0,0,0,0,(E+ΔE(k)),0,0].

From Assumption 2, we have

[y(kδ(k))gˆ(y(kδ(k)))]T[N˜1N˜2N˜2TI][y(kδ(k))gˆ(y(kδ(k)))]0, 19

where

N˜1=(N1TN2+N2TN1)2;N˜2=(N1T+N2T)2.

Then, from equations (18) and (19), we have

E{ΔV(k)}E{ΔV(k)}E{λ[y(kδ(k))g(y(kδ(k)))]T[N˜1N˜2N˜2TI][y(kδ(k))g(y(kδ(k)))]}=E{ϖ0T(k)[Λ11+σαWˆ01TR21Wˆ01+2Gˆ01T(k)(R11+R21)Gˆ01(k)+2Fˆ01T(k)R21Fˆ01(k)+2Gˆ11T(k)(R12+R22)Gˆ11(k)+2Sˆ01T(k)(R12+R22)Sˆ01(k)]ϖ0(k)+Γ0T(k)[Λ22+σβWˆ02TR22Wˆ02+2Gˆ02T(k)(R12+R22)Gˆ02(k)+2Fˆ02T(k)R22Fˆ02(k)+2Gˆ12T(k)(R11+R21)Gˆ12(k)+2Sˆ02T(k)(R11+P21)Sˆ02(k)]Γ0(k)}, 20

where

Λ22=[ψ12000000000R22000000000R32000000000R42λN˜1λN˜2T0000000λN˜2λI0000000000000000000I(R11+R21)000000000μ¯R51000000000μ¯R51].

Notice that, since Λ1<0 and Λ2<0, there are two scalars μ1>0 and μ2>0 such that

Λˆ1=Λ1+μ1[I2n×2n000]<0,Λˆ2=Λ2+μ2[I2n×2n000]<0. 21

Equation (21) implies

Λ11+μ1[I2n×2n000]+σαWˆ01TR21Wˆ01+2Gˆ01T(k)(R11+R21)Gˆ01(k)+2Fˆ01T(k)R21Fˆ01(k)+2Gˆ11T(k)(R12+R22)Gˆ11(k)+2Sˆ01T(k)(R12+R22)Sˆ01(k)<0,Λ22+μ2[I2n×2n000]+σβWˆ02TR22Wˆ02+2Gˆ02T(k)(R12+R22)Gˆ02(k)+2Fˆ02T(k)R22Fˆ02(k)+2Gˆ12T(k)(R11+R21)Gˆ12(k)+2Sˆ02T(k)(R11+R21)Sˆ02(k)<0. 22

First we satisfy (21) before proving the exponential stability. Using Lemma 2.4, the above equalities are equivalent to

Λ3(k)=[Λˆ11S1(k)J1]<0,Λ4(k)=[Λˆ22S2(k)J2]<0, 23

where

Λˆ11=Λ11+μ1[I2n×2n000],Λˆ22=Λ22+μ2[I2n×2n000],S1(k)=[2(R11+R21)Gˆ01(k)2R21Fˆ01(k)σαR21Wˆ012(R12+R22)Gˆ11(k)2(R12+R22)Sˆ01(k)]=[0000Ξ1500Ξ212R21AxΞ230000σαR21BxM0σαR21BxM0000000Ξ4400000000Ξ550],

where

Ξ15=2(R11+R21)(A+ΔA(k));Ξ21=2R21(Axα0BxM);Ξ23=2R21(1α0)BxM;Ξ44=2(R12+R22)(D+ΔD(k));Ξ55=2(R12+R22)(F+ΔF(k)),S2(k)=[2(R12+R22)Gˆ02(k)2R22Fˆ02(k)σβR22Wˆ022(R11+R21)Gˆ12(k)2(R11+R21)Sˆ02(k)]=[00000Θ16000Θ212R22AyΘ23000000σβR22ByN0σβR22ByN0000000000Θ450000000000Θ5700],

where

Θ16=2(R12+R22)(C+ΔC(k));Θ21=2R22(Ayβ0ByN);Θ23=2R22(1β0)ByN;Θ45=2(R11+R21)(B+ΔB(k));Θ57=2(R11+R21)(E+ΔE(k)),J1=diag{(R11+R21),R21,R21,(R12+R22),(R12+R22)},J2=diag{(R12+R22),R22,R22,(R11+R21),(R11+R21)}.

Note that S1(k) and S2(k) can be decomposed as

S1(k)=S1+ΔS1(k),S2(k)=S2+ΔS2(k), 24

where

S1=[0000Ξ¯1500Ξ212R21AxΞ230000σαR21BxM0σαR21BxM0000000Ξ¯4400000000Ξ¯550],Ξ¯15=2(R11+R21)A;Ξ¯44=2(R12+R22)D;Ξ¯55=2(R12+R22)F,ΔS1(k)=[00002(R11+R21)ΔA(k)00000000000000000002(R12+R22)ΔD(k)000000002(R12+R22)ΔF(k)0],S2=[00000Θ¯16000Θ212R22AyΘ23000000σβR22ByN0σβR22ByN0000000000Θ¯450000000000Θ¯5700],

where

Θ¯16=2(R12+R22)C;Θ¯45=2(R11+R21)B;Θ¯57=2(R11+R21)E,ΔS2(k)=[00000κ160000000000000000000000000κ450000000000κ5700],

where κ16=2(R12+R22)ΔC(k), κ45=2(R11+R21)ΔB(k), κ57=2(R11+R21)ΔE(k).

From Assumption 1, it follows readily that

ΔS1(k)=T¯1N(k)W¯1,ΔS2(k)=T¯2N(k)W¯2, 25

where

T1¯=[00002(R11+R21)T00000000000000000002(R12+R22)T000000002(R12+R22)T0],T2¯=[000002(R12+R22)T00000000000000000000000002(R11+R21)T00000000002(R11+R21)T00],W1¯=[0000W10000000000000000000W400000000W60],W2¯=[00000W30000000000000000000000000W20000000000W500].

Note that Λ3(k) and Λ4(k) can be decomposed as follows:

Λ3(k)=Λ3+ΔΛ3(k),Λ4(k)=Λ4+ΔΛ4(k), 26

where

Λ3=[Λˆ11S1J1]<0,ΔΛ3(k)=[0ΔS1(k)0],Λ4=[Λˆ22S2J2]<0andΔΛ4(k)=[0ΔS2(k)0].

Let

T˜1T=[0,T¯1T],W˜1=[W¯1,0],T˜2T=[0,T¯2T],W˜2=[W¯2,0].

Using Lemma 2.3(i), ΔΛ3(k) and ΔΛ4(k) can be rewritten as

ΔΛ3(k)=T˜1N(k)W˜1+W˜1TNT(k)T˜1Tε11T˜1T˜1T+ε1W˜1TW˜1,ΔΛ4(k)=T˜2N(k)W˜2+W˜2TNT(k)T˜2Tε21T˜2T˜2T+ε2W˜2TW˜2. 27

It is clear from equations (26) and (27) that

Λ3(k)Λ3+ε11T˜1T˜1T,Λ4(k)Λ4+ε21T˜2T˜2T, 28

where

Λ3=[Λ11+μ1[I2n×2n000]S1J1],Λ4=[Λ22+μ2[I2n×2n000]S2J2].

It follows from Lemma 2.4 that equation (22) is equivalent to the case that the right-hand side of equation (28) is negative definite. Hence, we come to the conclusion that Λ3(k)<0 and Λ4(k)<0, and therefore equation (22) holds. Moreover, the combination of equations (20) and (22) leads to

E{ΔV(k)}μ1E{|x¯(k)|2}μ2E{|y¯(k)|2}. 29

We are in a position to prove the stability of system (8). First, from equation (10), it is easily verified that

E{ΔV(k)}ε11E{|x¯(k)|2}+ε21i=kτMk1E{|x¯(i)|2}+ε12E{|y¯(k)|2}+ε22i=kδMk1E{|y¯(i)|2}, 30

where

ε11=max{λmax(R11),λmax(R21),λmax(R52)},ε21=(τMτm+1)(λmax(R31)+λmax(R41)),ε12=max{λmax(R12),λmax(R22),λmax(R51)},ε22=(δMδm+1)(λmax(R32)+λmax(R42)).

For any scalar ζ>1, the above inequality, combined with equation (29), indicates that

ζk+1E{V(k+1)}ζkE(V(k))=ζk+1E{ΔV(k)}+ζk(ζ1)E{V(k)}ζk+1(μ1E{|x¯(k)|2}μ2E{|y¯(k)|2})+ζk(ζ1),(ε11E{|x¯(k)|2}+ε21i=kτMk1E{|x¯(i)|2}+ε12E{|y¯(k)|2}+ε22E{|y¯(i)|2})=ζkη11(ζ)E{|x¯(k)|2}+ζkη21(ζ)i=kτMk1E{|x¯(i)|2}+ζkη12(ζ)E{|y¯(k)|2}+ζkη22(ζ)i=kδMk1E{|y¯(i)|2}, 31

where

η11(ζ)=ζμ1+(ζ1)ε11,η21(ζ)=(ζ1)ε21,η12(ζ)=ζμ2+(ζ1)ε12andη22(ζ)=(ζ1)ε22.

In addition, for any integer Nmax{δM,τM}+1, summing both sides of equation (31) from 0 to N1 with respect to k, we have

ζNE{V(N)}E{V(0)}η11(ζ)k=0N1ζkE{|x¯(k)|2}+η21(ζ)k=0N1i=kτMk1ζkE{|x¯(i)|2}+η12(ζ)k=0N1ζkE{|y¯(k)|2}+η22(ζ)k=0N1i=kδMk1ζkE{|y¯(i)|2}. 32

Note that, for τM,δM1,

k=0N1i=kτMk1ζkE{|x¯(i)|2}τMζτMmaxτMi0E{|Ω(i)|2}+τMζτMi=0N1ζiE{|x¯(k)|2},k=0N1i=kδMk1ζkE{|y¯(i)|2}δMζδMmaxδMi0E{|Π(i)|2}+δMζδMi=0N1ζiE{|y¯(k)|2}. 33

Then, from equations (32) and (33), one has

ζNE{V(N)}E{V(0)}+[η11(ζ)+τMζτMη21(ζ)]k=0N1ζkE{|x¯(k)|2}+τMζτMη21(ζ)maxτMi0E{|Ω(i)|2}+[η12(ζ)+δMζδMη22(ζ)]k=0N1ζkE{|y¯(k)|2}+δMζδMη22(ζ)maxδMi0E{|Π(i)|2}. 34

Let

ε01=min{λmin(R11),λmin(R21),λmin(R52)},ε˜1=max{ε11,ε21},ε02=min{λmin(R12),λmin(R22),λmin(R51)},ε˜2=max{ε12,ε22}.

It is clear that

E{V(N)}ε01E{|x¯(N)|2}+ε02E{|y¯(N)|2}. 35

It follows readily from equation (30) that

E{V(0)}ε˜1maxτMi0E{|Ω(i)|2}+ε˜2maxδMi0E{|Π(i)|2}. 36

Additionally, it can be verified that there exists a scalar ζ0>1 such that

η11(ζ0)+τMζ0τMη21(ζ0)=0,η12(ζ0)+δMζ0δMη22(ζ0)=0. 37

Substituting equations (35)–(37) into equation (34), we can get

ε01E{|x¯(N)|2}+ε02E{|y¯(N)|2}(ε˜1+τMζ0τMη21(ζ0))maxτMi0E{|Ω(i)|2}+(ε˜2+δMζ0δMη22(ζ0))maxδMi0E{|Π(i)|2}. 38

The above equation (38) completes the proof of exponential stability with vx(k)=0 and vy(k)=0. □

Remark 3.1

In this paper, we have considered the time-varying delays δ(k), τ(k) and the leakage delays ρ1, ρ2 in the negative feedback term of the GRNs which lead to the instability of the systems with small amount of leakage delay. This paper is to establish techniques to accord with the robust H state estimation concern for uncertain discrete stochastic GRNs (equation (1)) with leakage delays, distributed delays, and probabilistic measurement delays.

Consider that the H attainment of the estimation error system (8) is robustly stochastically stable with non-zero exogenous disturbance signals vx(k),vy(k)L2[0,).

Theorem 3.2

Let Assumptions 1 and 2 hold. Let the leakage delays ρ1, ρ2 and the estimation parameters Ax, Bx, Ay, By, and γ>0 be given. Then the estimation error system (8) is robustly stochastically stable with disturbance attenuation γ, if there exist positive definite matrices R11, R12, R21, R22, R31, R32, R41, R42, R51, R52 and three positive constant scalars λ, ε1, and ε2 such that the following LMI holds:

Λ1=[Λ110γ2IS10J100T¯1Tε1I]<0,Λ2=[Λ220γ2IS20J200T¯2Tε2I]<0, 39

and the other variables are described in Theorem 3.1.

Proof

Choose the Lyapunov–Krasovskii function (equation (10)) as in Theorem 3.1. For given γ>0, we define

T(n)=Ek=0n[x¯T(k)x¯(k)+y¯T(k)y¯(k)γ2vxT(k)vx(k)γ2vyT(k)vy(k)]. 40

Here, n is a nonnegative integer. Our aim is to show T(n)<0. Under the zero initial condition, we have

T(n)=Ek=0n[x¯T(k)x¯(k)+y¯T(k)y¯(k)γ2vxT(k)vx(k)γ2vyT(k)vy(k)+ΔV(k)]EV(n+1)T(n)+k=0nE(ΔV(k))=k=0nE{ϖT(k)[Λ˜11+σαW˜01TR21W˜01+2G˜01T(k)(R11+R21)G˜01(k)+2F˜01T(k)R21F˜01(k)+2G˜11T(k)(R12+R22)G˜11(k)+2S˜01T(k)(R12+R22)S˜01(k)]ϖ(k)+ΓT(k)[Λ˜22+σβW˜02TR22W˜02+2G˜02T(k)(R12+R22)G˜02(k)+2F˜02T(k)R22F˜02(k)+2G˜12T(k)(R11+R21)G˜12(k)+2S˜02T(k)(R11+R21)S˜02(k)]Γ(k)}, 41

where

ϖ(k)=[ϖ0(k),vx(k)]T,Γ(k)=[Γ0(k),vy(k)]T,W˜01=[Wˆ01T,0],G˜01(k)=[Gˆ01T(k),0],F˜01(k)=[Fˆ01T(k),0],G˜11(k)=[Gˆ11T(k),0],W˜02=[Wˆ02T,0],G˜02(k)=[Gˆ02T(k),0],F˜02(k)=[Fˆ02T(k),0],G˜12(k)=[Gˆ12T(k),0],S˜01(k)=[Sˆ01T(k),0],S˜02(k)=[Sˆ02T(k),0],Λ˜11=[Λ1100γ2I]andΛ˜22=[Λ2200γ2I].

By equation (41), in order to assure T(n)<0, we just need to show

Λ˜11+σαW˜01TR21W˜01+2G˜01T(k)(R11+R21)G˜01(k)+2F˜01T(k)R21F˜01(k)+2G˜11T(k)(R12+R22)G˜11(k)+2S˜01T(k)(R12+R22)S˜01(k)<0,Λ˜22+σβW˜02TR22W˜02+2G˜02T(k)(R12+R22)G˜02(k)+2F˜02T(k)R22F˜02(k)+2G˜12T(k)(R11+R21)G˜12(k)+2S˜02T(k)(R11+R21)S˜02(k)<0, 42

which, by Lemma 2.4, is equivalent to

Λ˜3(k)=[Λ˜11S¯1(k)J1]<0andΛ˜4(k)=[Λ22S¯2(k)J2]<0, 43

where

S¯1(k)=S¯1+ΔS¯1(k)=[S1,0]+[ΔS1(k),0],S¯2(k)=S¯2+ΔS¯2(k)=[S2,0]+[ΔS2(k),0]

and J1 and J2 are defined in Theorem 3.1. Note that Λ˜3(k) and Λ˜4(k) can be rearranged as follows:

Λ˜3(k)=Λ˜3+ΔΛ˜3(k),Λ˜4(k)=Λ˜4+ΔΛ˜4(k), 44

where

Λ˜3=[Λ˜11S¯1J1]<0andΔΛ˜3(k)=[0ΔS¯1(k)0],Λ˜4=[Λ˜22S¯2J2]<0andΔΛ˜4(k)=[0ΔS¯2(k)0].

Let

T˘1T=[0,T˜1T],W˘1=[W˜1,0],T˘2T=[0,T˜2T],W˘2=[W˜2T,0],T˘1T=[0,0,T¯1T],W˘1=[W¯1,0,0],T˘2T=[0,0,T¯2T]andW˘2=[W¯2,0,0].

Using Lemma 2.3(i), ΔΛ3(k) and ΔΛ4(k) can be rewritten as

ΔΛ˜3(k)=T˘1N(k)W˘1+W˘1TNT(k)T˘1Tϵ11T˘1T˘1T+ϵ1W˘1TW˘1,ΔΛ˜4(k)=T˘2N(k)W˘2+W˘2TNT(k)T˘2Tϵ21T˘2T˘2T+ϵ1W˘2TW˘2. 45

It is implied from equations (44) and (45) that

Λ˜3(k)[Λ110γ2IS10J1]+ϵ11T˘1T˘1T,Λ˜4(k)[Λ220γ2IS20J2]+ϵ21T˘2T˘2T. 46

Using Lemma 2.4, the above inequality (45) holds if and only if the right-hand side of (45) is negative definite, which implies T(n)<0. Letting n, we have

Ek=0{|x¯(k)|2+|y¯(k)|2}γ2Ek=0(|vx(k)|2+|vy(k)|2).

Hence the proof of Theorem 3.2 is complete. □

Theorem 3.3

With the help of the assumptions, system (7) becomes a robust H state estimator of GRNs (1) with leakage delays, distributed delays, and probabilistic measurement delays (5) if there exist positive definite matrices X1, X2, Y1, Y2, R11, R12, R21, R22, R31, R32, R41, R42, R51, and R52 and three positive constant scalars λ, ε1, and ε2 such that the following LMIs hold:

Λ1=[Λ110γ2IS10J100T¯1Tε1I]<0,Λ2=[Λ220γ2IS20J200T¯2Tε2I]<0,

where

S1=[0000Σ15002(X1α0X2M)2X12(1α0)X2M0000σαX2M0σαX2M00000002(R12+R22)D00000000Σ560],Σ15=2(R11+R21)A;Σ56=2(R12+R22)F,S2=[00000ϒ160002(Y1β0Y2N)2Y12(1β0)Y2N000000σβY2N0σβY2N00000000002(R11+R21)B0000000000ϒ5700],ϒ16=2(R12+R22)C;ϒ57=2(R11+R21)E,

and the other variables are described in Theorem 3.1. Furthermore, the state estimator gain matrices can be described as follows:

Ax=R211X1,Bx=R211X2,Ay=R221Y1andBy=R221Y2.

Proof

The rest of the proof of this theorem is the same as that of Theorem 3.2. Due to the limitation of the length of this paper, we omit it here. Then the proof of Theorem 3.3 is completed. □

Consider the discrete-time genetic regulatory network system:

x(k+1)=Ax(kρ1)+Bgˆ(y(kδ(k)))+Es=1μsh(y(ks))+σ(k,x(kρ1))ω(k)+Lxvx(k),y(k+1)=Cy(kρ2)+Dx(kτ(k))+Fn=1ξnx(kn)+Lyvy(k). 47

Corollary 3.1

Let the leakage delays ρ1, ρ2 and the estimation parameters Ax, Bx, Ay, and By be given and also the acceptable conditions hold. Then the estimation error system (8) with vx(k)=0 and vy(k)=0 is robustly exponentially stable in the mean square if there exist positive definite matrices R11, R12, R21, R22, R31, R32, R41, R42, R51, R52 and the positive constant scalar λ such that the following LMI holds:

Λ1=[Λ11S1J100I]<0,Λ2=[Λ22S2J200I]<0, 48

where

Λ11=[ψ110000000R210000000R310000000R41+ε1W4TW40000000HR110000000I(R12+R22)0000000ξ¯R52],Λ22=[ψ12000000000R22000000000R32000000000R42λN˜1+ε2W2TW2λN˜2T0000000λN˜2λI0000000000000000000I(R11+R21)000000000μ¯R51000000000μ¯R51],S1=[0000Ξ¯1500Ξ212R21AxΞ230000σαR21BxM0σαR21BxM0000000Ξ¯4400000000Ξ¯550],

where

Ξ¯15=2(R11+R21)A;Ξ¯44=2(R12+R22)D;Ξ¯55=2(R12+R22)F;Ξ21=2R21(Axα0BxM);Ξ23=2R21(1α0)BxM,S2=[00000Θ¯16000Θ212R22AyΘ23000000σβR22ByN0σβR22ByN0000000000Θ¯450000000000Θ¯5700],

where

Θ¯16=2(R12+R22)C;Θ¯45=2(R11+R21)B;Θ¯57=2(R11+R21)E;Θ21=2R22(Ayβ0ByN);Θ23=2R22(1β0)ByN,J1=diag{(R11+R21),R21,R21,(R12+R22),(R12+R22)},J2=diag{(R12+R22),R22,R22,(R11+R21),(R11+R21)},μ¯=s=1μs,ξ¯=n=1ξn,ψ11=R11+R31+(τMτm+1)R41+ξ¯R52;ψ12=R12+R32+(δMδm+1)R42,N˜1=(N1TN2+N2TN1)2;N˜2=(N1T+N2T)2.

Numerical examples

In this part, two mathematical examples with simulations are provided to show the effectiveness of the proposed robust state estimator.

Example 4.1

Consider the discrete-time GRN (1) with parameters given as follows:

A=(0.1000.2),B=(0.08000.2),C=D=(0.1000.1),E=(0.36000.1),d1=(0.1000.1),d2=(0.28000.135),Lx=(0.2000.5),Ly=(0.5000.2),W1=W2=W3=W4=W5=W6=(0.3000.3),μ=ξ=exp(2),F=0.4I,R=0.2I,G=(sin(k)00cos(k)),

and the leakage delays ρ1=ρ2=1. The regulatory function is taken as g(s)=s21+s2. The time-varying delays are chosen as δ(k)=3+(2sin(kπ/2)) and τ(k)=3+(2cos(kπ/2)), and the exogenous disturbance inputs are selected as vx(k)=sin(6k)exp(0.1k) and vy(k)=cos(2k)exp(0.2k).

Now consider the estimation error system (8) with parameters given by

A=0.1I,B=(0.1000.2),E=F=0.3I,C=D=0.2I,M=(0.6000.1),N=(0.400.30.5),R=(0.1000.3),N(k)=(sin(kπ/2)00cos(kπ/2)),α=0.001,β=0.003,d1=(0.2×(cos(π/2)2)000.1×(sin(π/2)1)),d2=(0.28000.135),Lx=(0.5000.2),Ly=(0.1000.1),W1=W2=W3=W4=W5=W6=0.1I,μ=ξ=exp(1),

and the leakage delays ρ1=ρ2=1. The exogenous disturbance inputs are selected as

vx(k)=(sin6k)exp(0.1k),vy(k)=(cos2k)exp(0.1k).

The regulatory function is taken as g(s)=s21+s2. The time-varying delays are chosen as δ(k)=3+(2sin(kπ/2)) and τ(k)=3+(2cos(kπ/2)). By using the Matlab LMI toolbox, LMIs (40) and (41) are solved and a set of feasible solutions is obtained as follows:

X1=(0.43380.00410.00410.2852),X2=(0.02100.02600.02600.0533),R11=(9.34340.00250.00256.9265),R21=(0.21690.48610.48610.9363),Y1=(1.19180.01280.01280.5832),Y2=(1.08360.22790.22790.1073).

The state estimator gain matrices can be determined as follows:

Ax=(1.21730.40600.63240.1804),Ay=(0.22030.00320.00630.2096),Bx=(2.11020.48311.37290.3185),By=(0.20050.42260.83420.3887).

The concentration of mRNA and protein and their estimation error are illustrated in Figs. 1 and 2 with the initial conditions ϕ1(k)={1,0.1}, ψ1(k)={0.9,0.7}, ϕ2(k)={0.9,0.8}, and ψ2(k)={0.15,0.9}.

Figure 1.

Figure 1

mRNA and protein concentration

Figure 2.

Figure 2

Estimation error for mRNA and protein concentration

Example 4.2

Consider the discrete-time GRN (47) with parameters given by

A=(0.3000.2),B=(0.502.50),C=(0.1000.2),D=(0.08000.2),E=(0.36000.1),F=(0.4000.4),d1=(0.6000.1),d2=(0.28000.135),Lx=(0.3000.4),Ly=(0.5000.2),

and the leakage delays ρ1=ρ2=1. The regulatory function is taken as g(s)=s21+s2. The time-varying delays are chosen as δ(k)=2 and τ(k)=1, and the exogenous disturbance inputs are selected as vx(k)=sin(6k)exp(0.1k) and vy(k)=cos(2k)exp(0.2k). The the state responses x(t) and y(t) are shown in Fig. 3.

Figure 3.

Figure 3

The state response x(t), y(t) of equation (47) with the mRNA and protein concentrations

Conclusions

In this paper, we have studied the approximation concern for the discrete-time stochastic GRNs with the leakage delays, distributed delays, and probabilistic measurement delays into the problem and modeled the robust H state estimator for a class of discrete-time stochastic GRNs. Here, the probabilistic measurement delays, which narrate the binary shifting sequence, are satisfied by the conditional probability distribution. So, the crisis of parameter uncertainties, including errors, stochastic disturbance, leakage delays, distributed delays, and the activation function of the addressed GRNs, is identified by sector-bounded nonlinearities. By applying the Lyapunov stability theory and stochastic analysis techniques, sufficient conditions are first entrenched to assure the presence of the desired estimators in terms of a linear matrix inequality (LMI). These circumstances are reliant on both the lower and upper bounds of time-varying delays. Again, the absolute expression of the desired estimator is demonstrated to assure the estimation error dynamics to be robustly exponentially stable in the mean square for the consigned system. Lastly, numerical simulations have been utilized to illustrate the suitability and usefulness of our advanced theoretical results.

Acknowledgements

This work was jointly supported by the National Natural Science Foundation of China under Grant No. 61573096, the Jiangsu Provincial Key Laboratory of Networked Collective Intelligence under Grant No. BM2017002, the Thailand research grant fund No. RSA5980019 and Maejo University.

Authors’ contributions

All authors contributed equally and significantly in writing this article. All authors read and approved the final manuscript.

Competing interests

The authors declare that they have no competing interests.

Footnotes

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Wang T., Ding Y., Zhang L., Hao K. Robust state estimation for discrete-time stochastic genetic regulatory networks with probabilistic measurement delays. Neurocomputing. 2013;111:1–12. doi: 10.1016/j.neucom.2012.12.011. [DOI] [Google Scholar]
  • 2.Wang Z., Liu Y., Liu X., Shi Y. Robust state estimation for discrete-time stochastic neural networks with probabilistic measurement delays. Neurocomputing. 2010;74:256–264. doi: 10.1016/j.neucom.2010.03.013. [DOI] [Google Scholar]
  • 3.Cao J., Ren F. Exponential stability of discrete-time genetic regulatory networks with delays. IEEE Trans. Neural Netw. 2008;19(3):520–523. doi: 10.1109/TNN.2007.911748. [DOI] [PubMed] [Google Scholar]
  • 4.Lv B., Liang J., Cao J. Robust distributed state estimation for genetic regulatory networks with Markovian jumping parameters. Commun. Nonlinear Sci. Numer. Simul. 2011;16:4060–4078. doi: 10.1016/j.cnsns.2011.02.009. [DOI] [Google Scholar]
  • 5.Shen B., Wang Z., Liang J., Liu X. Sampled-data H filtering for stochastic genetic regulatory networks. Int. J. Robust Nonlinear Control. 2011;21(15):1759–1777. doi: 10.1002/rnc.1703. [DOI] [Google Scholar]
  • 6.Wang L., Luo Z., Yang H., Cao J. Stability of genetic regulatory networks based on switched systems and mixed time-delays. Math. Biosci. 2016;278:94–99. doi: 10.1016/j.mbs.2016.06.004. [DOI] [PubMed] [Google Scholar]
  • 7.Hu J., Liang J., Cao J. Stabilization of genetic regulatory networks with mixed time-delays: an adaptive control approach. IMA J. Math. Control Inf. 2015;32:343–358. doi: 10.1093/imamci/dnt048. [DOI] [Google Scholar]
  • 8.Xiao M., Zheng W., Cao J. Stability and bifurcation of genetic regulatory networks with small RNAs and multiple delays. Int. J. Comput. Math. 2014;91:907–927. doi: 10.1080/00207160.2013.808741. [DOI] [Google Scholar]
  • 9.Xiao M., Cao J. Genetic oscillation deduced from Hopf bifurcation in a genetic regulatory network with delays. Math. Biosci. 2008;215(1):55–63. doi: 10.1016/j.mbs.2008.05.004. [DOI] [PubMed] [Google Scholar]
  • 10.Chesi G. Robustness analysis of genetic regulatory networks affected by model uncertainty. Automatica. 2011;47:1131–1138. doi: 10.1016/j.automatica.2010.10.012. [DOI] [Google Scholar]
  • 11.Hu J., Liang J., Cao J. Stability analysis for genetic regulatory networks with delays: the continuous-time case and the discrete-time case. Appl. Math. Comput. 2013;220:507–517. [Google Scholar]
  • 12.Huang C., Cao J., Xiao M. Hybrid control on bifurcation for a delayed fractional gene regulatory network. Chaos Solitons Fractals. 2016;87:19–29. doi: 10.1016/j.chaos.2016.02.036. [DOI] [Google Scholar]
  • 13.Chesi G. On the steady states of uncertain genetic regulatory networks. IEEE Trans. Syst. Man Cybern., Part A, Syst. Hum. 2012;42(4):1020–1024. doi: 10.1109/TSMCA.2011.2178829. [DOI] [Google Scholar]
  • 14.Ma L., Da F., Zhang K. Exponential H filter design for discrete time-delay stochastic systems with Markovian jump parameters and missing measurements. IEEE Trans. Circuits Syst. 2011;58(5):994–1007. doi: 10.1109/TCSI.2010.2089554. [DOI] [Google Scholar]
  • 15.Wang Z., Ho D.W.C., Liu X. Variance-constrained filtering for uncertain stochastic systems with missing measurements. IEEE Trans. Autom. Control. 2003;48(7):1254–1258. doi: 10.1109/TAC.2003.814272. [DOI] [Google Scholar]
  • 16.Bao H., Cao J. Exponential stability for stochastic BAM networks with discrete and distributed delays. Appl. Math. Comput. 2012;218(11):6188–6199. [Google Scholar]
  • 17.Wang Z., Yang F., Ho D.W.C., Liu X. Robust H filtering for stochastic time-delay systems with missing measurements. IEEE Trans. Signal Process. 2006;54(7):2579–2587. doi: 10.1109/TSP.2006.874370. [DOI] [Google Scholar]
  • 18.Sun Y., Feng G., Cao J. Robust stochastic stability analysis of genetic regulatory networks with disturbance attenuation. Neurocomputing. 2012;79:39–49. doi: 10.1016/j.neucom.2011.09.023. [DOI] [Google Scholar]
  • 19.Sakthivel R., Raja R., Marshal Anthoni S. Asymptotic stability of delayed stochastic genetic regulatory networks with impulses. Phys. Scr. 2010;82(5):055009. doi: 10.1088/0031-8949/82/05/055009. [DOI] [Google Scholar]
  • 20.Wei G., Wang Z., Shen B., Li M. Probability-dependent gain-scheduled filtering for stochastic systems with missing measurements. IEEE Trans. Circuits Syst. II. 2011;58(11):753–757. doi: 10.1109/TCSII.2011.2168018. [DOI] [Google Scholar]
  • 21.Yang X., Ho D.W.C. Synchronization of delayed memristive neural networks: robust analysis approach. IEEE Trans. Cybern. 2016;46(12):3377–3387. doi: 10.1109/TCYB.2015.2505903. [DOI] [PubMed] [Google Scholar]
  • 22.Yang X., Lu J. Finite-time synchronization of coupled networks with Markovian topology and impulsive effects. IEEE Trans. Autom. Control. 2016;61(8):2256–2261. doi: 10.1109/TAC.2015.2484328. [DOI] [Google Scholar]
  • 23.Liu J., Tian E., Gu Z., Zhang Y. State estimation for Markovian jumping genetic regulatory networks with random delays. Commun. Nonlinear Sci. Numer. Simul. 2013;19(7):2479–2492. doi: 10.1016/j.cnsns.2013.11.002. [DOI] [Google Scholar]
  • 24.Wan X., Xu L., Fang H., Ling G. Robust non-fragile H state estimation for discrete-time genetic regulatory networks with Markov jump delays and uncertain transition probabilities. Neurocomputing. 2015;154:162–173. doi: 10.1016/j.neucom.2014.12.008. [DOI] [Google Scholar]
  • 25.Liang J., Lam J., Wang Z. State estimation for Markov-type genetic regulatory networks with delays and uncertain mode transition rates. Phys. Lett. A. 2009;373:4328–4337. doi: 10.1016/j.physleta.2009.09.055. [DOI] [Google Scholar]
  • 26.Wang Z., Lam J., Wei G., Fraser K., Liu X. Filtering for nonlinear genetic regulatory networks with stochastic disturbances. IEEE Trans. Autom. Control. 2008;53(10):2448–2457. doi: 10.1109/TAC.2008.2007862. [DOI] [Google Scholar]

Articles from Advances in Difference Equations are provided here courtesy of Springer

RESOURCES