Abstract
Hybrid models of genetic regulatory networks allow for a simpler analysis with respect to fully detailed quantitative models, still maintaining the main dynamical features of interest. In this paper we consider a piecewise affine model of a genetic regulatory network, in which the parameters describing the production function are affected by polytopic uncertainties. In the first part of the paper, after recalling how the problem of finding a Lyapunov function is solved in the nominal case, we present the considered polytopic uncertain system and then, after describing how to deal with sliding mode solutions, we prove a result of existence of a parameter dependent Lyapunov function subject to the solution of a feasibility linear matrix inequalities problem. In the second part of the paper, based on the previously described Lyapunov function, we are able to determine a set of domains where the system is guaranteed to converge, with the exception of a zero measure set of times, independently from the uncertainty realization. Finally a three nodes network example shows the validity of the results.
1 Introduction
In the last few years control theory tools have been extensively used in biology, to both understand natural biological systems or design new ones to perform specific tasks (Blanchini et al. 2018; Qian et al. 2018). Within a cell, in fact, multiple regulatory mechanisms coexist (Alon 2007; Freeman 2014) and among these, transcriptional regulation involving genes and transcription factors plays a crucial role. Transcription factors are proteins which can either activate or inhibit the transcription of different genes, which in turn can produce other transcription factors, determining a set of relations described by a gene regulatory network (GRN) (Alon 2007). Different modelling approaches are used to mathematically describe a GRN, depending on whether the analysis to perform is either quantitative or qualitative (Karlebach and Shamir 2008). Continuous models, derived from the study of chemical reaction networks and quasisteady state approximation of faster dynamics, usually involve Hill functions to describe regulatory interactions and are particularly well suited for a quantitative analysis (Alon 2007; Le Novère and Nicolas 2015; Murray and Del Vecchio 2014). However, a quantitative approach may not always be possible as biological systems are inherently uncertain and the measurement of key quantities may be affected by noise or impossible to take; for these reasons, qualitative approaches have been developed in literature. Asynchronous boolean networks have been studied to analyse complex biological systems (see for example Tournier and Chaves 2009 and references therein), as many interactions and system quantities can be described by logic variables (e.g. HIGH or LOW concentration, protein production is ACTIVE or INACTIVE, etc.). Despite being a valid and simple method, completely discrete analysis can lose track of some dynamical behavior (Saadatpour and Albert 2016) and it may be necessary to consider hybrid models. The hybrid modelling approach was introduced in Glass and Kauffman (1973) and has been studied and adapted by many authors (see for example Casey et al. 2006; De Jong et al. 2003, 2004; Ropers et al. 2006; Cummins et al. 2016; Gedeon 2020). Based on the step approximation of steep Hill functions (Alon 2007), this approach gives rise to a piecewise affine (PWA) model. In Casey et al. (2006) the authors studied this model and gave stability conditions of equilibria based on a State Transition Graph (STG), a graph that qualitatively describes the system trajectories. The STG is unchanged for a large range of parameters, making this kind of analysis attractive when the system’s knowledge is partial. Despite being a valid tool, there are a few limitations in the use of STGs. These graphs in fact, besides introducing spurious qualitative trajectories (i.e. paths in the graph that do not correspond to trajectories of the original system) (Casey et al. 2006), do not give clear answers when cycles are present (Grognard et al. 2007), making it difficult to distinguish between damped oscillations and limit cycles. This motivates the development of tools that can fill these gaps, by complementing these qualitative tools, exploiting additional quantitative information from the system. One of the most common approach in this sense is to consider Lyapunov functions, which can help to discriminate between different kind of dynamical behaviors, otherwise indistinguishable from the graph, and the use of which is even suggested in the Conclusion of Casey et al. (2006), and which are the object of this work. The use of Lyapunov functions in the study of biochemical networks is well known in literature. In Ali AlRadhawi and Angeli (2016) the authors studied chemical reaction networks stability and control, using piecewise linear in rates Lyapunov functions, in Blanchini and Giordano (2014) the authors employed piecewise linear Lyapunov functions to assess structural properties of biological networks, while in Chesi and Hung (2008) the authors, based on a linear matrix inequalities (LMIs) framework, used polynomial Lyapunov functions to study the stability of genetic regulatory networks with SUM regulatory functions. In our previous work (Pasquini and Angel 2019) we considered the aforementioned PWA model of a GRN and, using the model structure and the information from the STG, we developed an LMI framework to find a Lyapunov function for the system, in order to assess its convergence properties, even in the presence of cycles in the STG. In that context we assumed complete knowledge of the system’s parameters, an assumption that in general does not hold. However, Lyapunov methods are used also in the uncertain setting and a particular case is that of polytopic uncertainties for linear systems, in which the system’s matrix is the convex combination of a set of known matrices, with the weights of this combination being unknown. Two approaches are generally employed in literature. The first one consists in searching for a Lyapunov function which is common between all the systems obtained by considering the realizations associated with the vertices of the uncertainty polytope (Liberzon 2003; Lin and Antsaklis 2005). This approach, although allowing to conclude certain stability and stabilizability properties of the system, is challenging and can lead to a conservative solution, as it does not consider how the extremal behaviors are combined in any given uncertainty realization. The other approach, which we will consider in this work to deal with polytopic uncertainties, is to search for a parameter dependent Lyapunov function (PDLF). In Gahinet et al. (1996) the authors first showed how to convexify the problem of finding an affinely parameter dependent Lyapunov function, through the solution of a set of LMIs. Following this many authors proposed different LMIs framework to deal with linear parameter varying systems stability (Chesi et al. 2004; Neto 1999; Oliveira and Peres 2006) and stabilizability (Lin and Antsaklis 2007; Zhai et al. 2003) through the use of PDLFs, which are in general polynomially dependent on the uncertain parameters. Although the literature on parameter dependent lyapunov functions for polytopic uncertain systems is vast and still developing, many aspects are not usually considered. In most of the cases where both polytopic uncertainties and switching systems are considered, the problem of stabilizability is addressed (i.e. the choice of a switching signals to stabilise the system). However, in a PWA model of a GRN, the switching is state dependent and cannot be chosen. Moreover multistability, which is a common property of biological systems, is usually not considered; instead global asymptotic stability of a single equilibrium is a common theme in many of these works. For example in Arcak and Sontag (2008) the authors propose techniques based on dissipativity of individual gene subsystems in order to build separable Lyapunov functions that can be used to assess global asymptotic stability of the network. LMI conditions are used to infer the parameter ranges where such conditions can be fulfilled. In contrast, our paper does not focus on global asymptotic stability properties and exploits the structure of PWA models in order to build robust Lyapunov function for global convergence analysis.
In the present paper we consider polytopic uncertainties in piecewise affine models of GRNs, to address the issue that the system’s parameters may not be perfectly known (as in qualitative methods), but bounded within preassigned ranges. We provide an LMI framework whose solution describes a parameter dependent piecewise quadratic Lyapunov function (PDPWQLF) for the system, i.e. a Lyapunov function that depends explicitly on the unknown parameters describing the particular uncertainty realization, which will allow us to describe a convergence set for the system, robust with respect to the uncertainty. Our analysis can deal with multistable systems, as information on equilibria location is not explicitly taken into consideration when defining the LMI framework. Moreover it is remarked that even if in literature there are results on parameter dependent Lyapunov functions with more complex and general structures (see for example Chesi et al. 2005), in this work we consider parameter dependent Lyapunov functions which are only affinely dependent on the system’s uncertain parameters, as these allow to deal in a straightforward manner with sliding mode monotonicity and continuity on the boundary of regulatory domains, as it will be clear in the following. The paper is structured as follows: in Sect. 2 some mathematical notation and preliminaries are defined, while in Sect. 3 the piecewise affine model and its differential inclusion extension are described, together with a brief recap of our work (Pasquini and Angel 2019) on piecewise quadratic Lyapunov functions for the nominal PWA model. In Sect. 4 the main contribution of the paper is presented: first we describe the considered polytopic uncertain model and the desired form of the Lyapunov function, then, after a discussion on the constraints that need to be enforced by this function, we give the conditions for its existence in the form of an LMI framework (Theorem 1). Finally we prove that, for any realization of the system uncertainty, the set where the system converges is contained in a computable set depending only on the vertices value of the uncertainty polytope. In Sect. 5 we give a numerical example showing the applicability and the validity of the results for a three nodes GRN, while Sect. 6 concludes the paper and give some possible directions for future developments.
2 Mathematical background
Let \(v = \begin{bmatrix} v_1 \ldots v_n \end{bmatrix}^T\) be a vector in \({\mathbb {R}}^n\). With \(v \ge 0\) we mean that all the components of v are nonnegative. The set of all \(v \in {\mathbb {R}}^n\) such that \(v \ge 0\) is denoted with \({\mathbb {R}}^n_+\). Let \(W = \{w_1, \ldots , w_m\}\) be a set of vectors. We define the conic hull of W as \({\text {cone}(W) := \{v \in {\mathbb {R}}^n \  \ \exists \alpha \in {\mathbb {R}}^m_+ \ s.t. \ v = \sum \nolimits _{i = 1}^m \alpha _i w_i \}}\). Let \(S_m\) denote the standard simplex of dimension m, i.e. the set \(S_m:=\{\alpha \in {\mathbb {R}}^n_+  \sum \nolimits _{i=1}^m \alpha _i = 1\}\) .
We define the convex hull of W as \(\text {conv}(W) := \{v \in {\mathbb {R}}^n \  \ \exists \alpha \in S_m \ s.t. \ v = \sum \nolimits _{i = 1}^m \alpha _i w_i \}\).
A setvalued map \(H : X \rightarrow 2^Y\) is a map that associates a point in X to a subset of Y.
With \(\sum \nolimits _{v \in W}\) we denote the sum over the elements of the countable set W, while with \(\bigcup \nolimits _{v' \in W'}\) we denote the union over the elements of the set \(W'\).
Given a matrix \(M \in {\mathbb {R}}^{n \times n}\), \(M_{ij}\) denotes the element in its ith row and jth column. Let \(M \in {\mathbb {R}}^{n \times n}\) be a symmetric matrix. We denote with \(M \succ 0 (M \succeq 0)\) the fact that M is positive definite (semidefinite), and with \(M \prec 0 (M \preceq 0)\) the fact that M is negative definite (semidefinite).
A polyhedron P in \({\mathbb {R}}^n\), is the set described by:
Equation (1) is called the Hrepresentation of P. Every polyhedron’s Hrepresentation can be converted to a Vrepresentation (Avis et al. 2002; Herceg et al. 2013; Iervolino et al. 2017b), namely:
where \(V = \begin{bmatrix}v_1 \ldots v_\nu \end{bmatrix}\) denotes the set of vertices of P, and \(R = \begin{bmatrix} r_1 \ldots r_\rho \end{bmatrix}\) the set of its rays, with the notation in (2) meaning that any element in P can be expressed as the sum of an element belonging to \(\text {conv}\{V\}\) and an element belonging to \(\text {cone}\{R\}\). Any polyhedron P in \({\mathbb {R}}^n\) can be embedded in an higher dimensional cone, called the homogenization cone, i.e. the cone:
where:
The homogenization cone of P has the property that P can be obtained as the intersection of the cone with an hyperplane \({\mathscr {H}}\) in \({\mathbb {R}}^{n+1}\), thus allowing to give sufficient conditions which guarantee a chosen quadratic function to be either positive or negative definite (semidefinite), inside the original polyhedron P.
In particular we recall the following property from Iervolino et al. (2017a), which we also used in Pasquini and Angel (2019), to express sign definiteness conditions of quadratic functions inside a polyhedron P.
Consider the quadratic function:
where:
Let P be a polyhedron and \({\hat{C}}_P\) its homogenization cone, defined above. Then it holds:
where \(\varGamma \) is the matrix whose columns are the rays of the cone \({\hat{C}}_P\), N is any entrywise nonnegative matrix and \({\overline{M}} \preceq _{{\hat{C}}_P} 0\) means that the quadratic function (3) is nonpositive for any \(x \in {\hat{C}}_{P}\), and consequently in the polyhedron P. For further details the interested reader is referred to Iervolino et al. (2017a).
3 Hybrid models of GRNs and Lyapunov functions
3.1 Hybrid model
In this section the hybrid model considered to describe the GRN dynamics is presented. This section is mainly recalled from (Casey et al. 2006; De Jong et al. 2004; Pasquini and Angeli 2018), to which the reader is referred for a more comprehensive discussion
Let \(C \in {\mathbb {R}}^{n \times n}\) be a diagonal matrix with positive entries and let \(f : {\mathbb {R}}^n_+ \rightarrow {\mathbb {R}}^n_+\) be a piecewise constant function, defined on a box partition of the positive orthant (partition that will be characterised below). We consider the following hybrid model:
where \(x = \begin{bmatrix} x_1&\ldots&x_n \end{bmatrix}^T\in {\mathbb {R}}^n_+\) represents the protein concentration vector (with \(x_i\) being the concentration of the protein \(P_i\)), \(C = \text {diag}(c_1, \ldots , c_n)\), with \(c_i > 0\), represents the degradation rates matrix and \(f(x) = \begin{bmatrix} f_1(x)&\ldots&f_n(x) \end{bmatrix}^T\) represents the production rate function, sometimes referred to as the regulation function.
Let any axis \({\mathscr {X}}_i\) of the positive orthant, be partitioned as:
The \(\theta \)s in (6) are called thresholds. Such partition divides the state space in open boxes, inside which we consider the regulation function f(x) to be constant. These boxes are called regulatory domains, as opposed to the ones called switching domains, in which at least one of the state variables takes on a threshold value. We define the order of a switching domain \(D_s\) as the number of switching variables in \(D_s\) i.e. state variables that are on one of their threshold values.
The set of regulatory domains is denoted by \({\mathscr {D}}_R\), while the set of switching domains is denoted by \({\mathscr {D}}_S\). Inside each regulatory domain D the production function is considered constant and indicated as \(f_D\), hence the dynamics is affine, with the property that any trajectory monotonically converges towards the focal point \(\phi (D) = C^{1} f_D\) and, if this is not in \(\text {cl}(D)\), then the trajectory will eventually leave the domain (Casey et al. 2006).
Remark 1
The above definition of the production function for system (5), is a consequence of the ON–OFF approximation of the gene input functions (Alon 2007). In fact in works like Casey et al. (2006) and De Jong et al. (2004), and our previous work Pasquini and Angeli (2018), the production function is considered as a combination of step functions, the thresholds of which give rise to the same box partition described above defining, de facto, a piecewise constant function. In Plahte et al. (1998) the authors gave a general framework which allows to describe any logical function with the use of steps or sigmoids functions. \(\blacktriangleleft \)
The switching domains are the zero measure sets where the production rate function is not uniquely defined and so a further construction due to Filippov (1988) is used. In particular the system is extended to a differential inclusion:
for which:
in which R(D) denotes the set of regulatory domains adjacent to the switching domain D. A solution (in the sense of Filippov) of system (5) is an absolutely continuous function \(x(\cdot )\), satisfying the differential inclusion (7), for almost every t, with the setvalued map F defined as in (8). It is possible that a solution \(x(\cdot )\) of the differential inclusion (7), lays for a certain amount of time on a switching domain (i.e. on the surface of discontinuity of f(x)), leading to a so called sliding mode solution.
As explained in Casey et al. (2006) and De Jong et al. (2003, 2004), it is possible to define a state transition graph of the PWA system, a graph that qualitatively characterise the system trajectories in relation to the domains (both regulatory and switching). This construct will appear in a later assumption (Assumption 1), but for more details on how the STG can be constructed and used, the interested reader is referred to the aforementioned literature.
We now introduce a simple example that will help clarify the above notation.
3.2 Example: toggle switch
Consider the following piecewise affine model of a toggle switch (the GRN of which is depicted in Fig. 1):
where \(s^(x_i,\theta _j)\) is the step function:
and \(b_{10} = 0.02\), \(b_{20} = 0.08\), \(b_{11} = 3\), \(b_{21} = 3.5\), \(c_1 = 0.7\), \(c_2 = 1.1\), \(\theta _1 = \theta _2 = 2\).
The toggle switch is one of the simplest gene regulatory networks to consider [and one of the first networks that has been built synthetically (Collins et al. 2000)], in which two proteins \(P_1\) and \(P_2\) act as each other inhibition transcription factor. For certain sets of parameters, the system is known to show bistability, as the two stable configurations are when one of the two proteins concentration is high, while the other one is low.
As can be seen in Fig. 2, the thresholds \(\theta _1\) and \(\theta _2\) give rise to four regulatory domains (i.e. \(D_1\), \(D_2\), \(D_3\), \(D_4\)), and five switching domains: four of which of order 1 (e.g. the domain \(D' = \partial D_1 \cap \partial D_2\)) and one of order 2 (i.e. \(D'' = \partial D_1 \cap \partial D_2 \cap \partial D_3 \cap \partial D_4 \)). The procedure described in De Jong et al. (2004) generates the state transition graph in Fig. 3. In this graph: the blue nodes are associated to regulatory domains, while the red ones are associated to switching domains (one circle: domains of order 1, two circles: domains of order 2). It is clear from it that the system exhibits bistability, property that is also confirmed by the trajectories in Fig. 4.
The intersection between the closure of the four regulatory domains (i.e. the point \((\theta _1,\theta _2)\)) is a singular equilibrium—in the sense that \(0 \in F(\theta _1,\theta _2)\), with F(x) being the setvalued map defined in (8)
3.3 Piecewise quadratic Lyapunov function
Lyapunov functions are a tool that is extensively used in control theory and the study of dynamical systems, allowing the study of stability and convergence properties (Khalil 2002). In Pasquini and Angeli (2018) we presented an LMI framework to find, if one exists, a Piecewise Quadratic Lyapunov function (PWQLF) for system (5), which can be formally proved to be eventually nonincreasing along any system trajectory (Pasquini and Angel 2019). In particular the Lyapunov function V is defined as:
and it is asked to satisfy the following constraints:
where \(T_x D\) is the tangent cone to D in x, \(\overline{\nabla {V}}_D\) represents the gradient of the function \(V_{{\hat{D}}}\), with \({\hat{D}}\) being any regulatory domain adjacent to D, and \(\mathscr {CD}\) denotes the set of switching domains on which we asked the function V to be continuous, namely the ones for which the set of sliding mode directions is nonempty and the ones associated to cycles in the State Transition Graph.
To summarise: constraints (12) and (13) are relative to the monotonicity of the Lyapunov function in regulatory domains and switching domains with sliding modes respectively, while (14) refers to the continuity of the Lyapunov function in particular switching domains—the set of which is referred as \(\mathscr {CD}\).
These constraints are enforced through a set of LMIs, which is omitted here for the sake of space and ease of explanation, however, for further details on the description and derivation of this set, the interested reader is referred to our previous works (Pasquini and Angel 2019; Pasquini and Angeli 2018). In particular it can be proven that, for a function V satisfying (12)–(14), the following property holds:
Proposition 1
Consider the system (5) and let \(V : {\mathbb {R}}^n_+ \rightarrow {\mathbb {R}}\) be a Lyapunov function satisfying (12)–(14). Then:
where \(\mu (S)\) denotes the Lebesgue measure of the set S.
In the following we refer to property (15) as a result of convergence to zero of \({dV \over dt}(x(t))\) in the sense of measure.
In words, condition (15) states that, given an arbitrarily small \(\varepsilon > 0 \) and a set \(\varOmega \) where the solution \(x(\cdot )\) is contained [e.g. \(\varOmega = {\mathbb {R}}^n_+\) or \(\varOmega = {\mathscr {B}}\), with \({\mathscr {B}}\) being a positively invariant set with respect to (5)], then as \(t \rightarrow \infty \) the solution will be almost surely (in the sense of Lebesgue measure) in the set \(\varOmega {\setminus } \{x \in \varOmega \ \ {\dot{V}}(x) < \varepsilon \}\). This means that, by taking values of \(\varepsilon \) converging to 0, we can infer information on the convergence set for the system.
Remark 2
In Pasquini and Angel (2019) a few more technicalities are introduced to avoid the convergence to a set where the Lyapunov function is not defined. This has been done exploiting a construction—called natural extension of the Lyapunov function—which is equal to the original function V almost everywhere. More details can be found in the aforementioned paper. \(\blacktriangleleft \)
The existence of a feasible solution to this set of LMIs, and consequently of a Lyapunov function for the system, is strictly dependent on the system parameters, which are often highly uncertain due to the nature of biological systems. In the next Section the case of uncertainties on the production rate function is considered.
4 Main contribution
We now introduce polytopic uncertainties on the production rate function, to model the fact that its exact value is unknown and possibly subject to variability.
Let \(C \in {\mathbb {R}}^{n \times n}\) be a diagonal matrix with positive diagonal entries and let \(f^1(x), \ldots , f^L(x)\) be L piecewise constant production functions, as defined in Sect. 3. Consider the system \(\varSigma _k\), defined as:
\(\varSigma _k\) is called an extremal system. Let \({\mathscr {U}}(f^1,\ldots ,f^L)\) be the set of systems:
in which:
and \(S_L\) is the standard simplex of dimension L.
In the following we will use the shortened notation:
as the dependence of the set from the considered functions \(f^1, \ldots , f^L\) is implicit.
From now on the following Assumption is considered to be satisfied:
Assumption 1
All extremal systems \(\varSigma _1, \ldots , \varSigma _L\) have the same State Transition Graph (STG) and the same thresholds. \(\blacktriangleleft \)
Remark 3
The first part of Assumption 1 is not too restrictive, in the sense that the STG is generally unchanged under a large range of parameters (see Casey et al. 2006; De Jong et al. 2004), and assuming that the STG is the same for all extremal systems means that these are “qualitatively” similar, which is the starting point of this analysis. If multiple graphs arise one could, in principle, attempt a partition of the uncertainty set, so as to recover Assumption 1 on each of its element.
On the other hand to consider that thresholds are unchanged among all extremal systems can be artificial. However, considering uncertain thresholds, entails a structural change in the positive orthant partition, with remarkable difficulties in imposing continuity constraints—which will potentially convert in nonlinear constraints, given how condition (14) is ultimately enforced (see (Pasquini and Angel 2019, Eq. (43)) or Eq. (42)–(44) of this work). We recognize the need to address this matter in potential future research. \(\blacktriangleleft \)
4.1 Example: toggle switch with polytopic uncertainties
To better clarify the new notation introduced above, consider again the toggle switch example of Sect. 3.2, but this time allow \(b_{11} \in [b_{11}^,\ b_{11}^+]\) and \(b_{21} \in [b_{21}^,\ b_{21}^+]\), with \(b_{11}^ = b_{21}^ = 2.5\) and \(b_{11}^+ = b_{21}^+ = 5\).
We can define the four extremal systems:
It is easy to verify (see Casey et al. 2006 for example) that all extremal systems share the same STG. The set \({\mathscr {U}}_1^4\), of possible system realizations given the uncertainty, can be rewritten in a parametrized form as:
with \(\lambda \in S_4\), or equivalently:
with \(\eta _i \in [0,1]\), for \(i = \{1,2\}\).
By varying \(\lambda \in S_4\) (or \(\eta \in S_1 \times S_1\)) we obtain different realizations \(\sigma ^\lambda \in {\mathscr {U}}_1^4\), with the two stable equilibria moving depending on such parameters, while saddle point \((\theta _1,\theta _2)\) remains unchanged (following the structure of the system and Assumption 1). In Fig. 5, trajectories for different realizations \(\sigma ^\lambda \in {\mathscr {U}}_1^4\) are shown, starting from the same initial points.
\(\blacktriangleleft \)
In the following we will prove that we can define a set of linear matrix inequalities (LMIs) that, if satisfied, guarantees the existence of a Parameter Dependent Piecewise Quadratic Lyapunov Function (PDPWQLF) of the form:
where \(V^k(x)\) is a particular PWQLF for the kth extremal system \(\varSigma ^k\), will be called an extremal Lyapunov function and will assume the form (11). Formally speaking, given a certain \(\lambda \in S_L\), \(V^\lambda (x)\) is a PWQLF for the system \(\sigma ^\lambda \in {\mathscr {U}}^1_L\), and this will hold for all the \(\lambda \in S_L\).
The set of LMIs to satisfy will take into account: the conditions to make \(V^k(x)\) an extremal Lyapunov function for \(\varSigma ^k\) and the conditions to guarantee that \(V^\lambda (x)\) is a PWQLF for \(\sigma ^\lambda \).
Remark 4
Asking for \(V^k(x)\) to be an extremal Lyapunov function for the system \(\varSigma ^k\), corresponds to asking (12)–(14) for \(V^k\), with respect to \(\varSigma ^k\) , with the only exception of the constraints on monotonicity along sliding modes (13), that should be substituted as explained in the next section. This is due to the fact that asking for \(V^k\) to be nonincreasing along any sliding mode solution of \(\varSigma ^k\), is not enough to guarantee that \(V^\lambda \) in (19) will be nonincreasing along any sliding mode solutions of \(\sigma ^\lambda \). \(\blacktriangleleft \)
4.2 Sliding mode directions description
Consider a switching domain \(D_s\). For any system in \({\mathscr {U}}_1^L\), any potential sliding mode direction f on \(D_s\), can be expressed as:
where \(\gamma \in S_{L \cdot q}\) and \(q := R(D_s)\). The \(\gamma \)s in (20) are the weights of a convex combination that takes into account all extremal systems, in order to generate candidate sliding mode directions at \(x \in D_s\).
Let \(I_{D_s}\) be the set of switching variables in \(D_s\) (i.e. the variables that are on their thresholds in \(D_s\)).
The following polyhedron \({\mathscr {P}}_{D_s}\) can be defined:
where \({\bar{c}}\) is a vector, the ith component of which is:
where \(c_i\) is the degradation rate of the protein \(P_i\) and \(\theta _{i,k}\) is the threshold value assumed by \(x_i\) in the switching domain \(D_s\) [see axis partition (6)], while \(\overline{F^k}\) is the matrix:
in which \((f^k_D)^{I_{D_s}}\) is the vector obtained by selecting only the components from \((f^k_D)\), indexed by \(I_{D_s}\), and \(\{D_{i_1}, \ldots , D_{i_q}\}\) is the set of regulatory domains adjacent to \(D_s\). \({\mathscr {P}}_{D_s}\) contains all the \(\gamma \)s that give rise to sliding mode directions and, by construction, it is the same among all the extremal systems and all the systems in \({\mathscr {U}}_1^L\). Being \({\mathscr {P}}_{D_s}\) a subset of the standard simplex \(S_{L \cdot q}\), it is bounded and so can be written as:
Following an approach similar to the one we used in Pasquini and Angeli (2018), if every extremal Lyapunov function \(V^k\) is monotone along the directions obtained by selecting the \(\gamma \)s in \({\mathscr {P}}_{D_s}\), then the function \(V^\lambda \) will be monotone along any sliding modes solution.
The above property can be satisfied, by enforcing the following set of LMIs for any extremal LF \(V^k\):
where \(\varGamma _{D_s}\) is the ray matrix of the homogenization cone \({\hat{C}}_{D_s}\) of \(D_s\), \(M^k_{D_s}\) is any entrywise nonnegative and symmetric matrix and:
where \(P_D^k\) and \(d_D^k\) are the matrices \(P_D\) and \(d_D\) in (11), for the extremal LF \(V^k\), \(w_j\) is the jth vertex of \({\mathscr {P}}_{D_s}\) and F is the matrix defined as:
with:
where \(\{D_{i_1}, \ldots , D_{i_q}\}\) is the set of regulatory domains adjacent to \(D_s\).
Remark 5
The above approach is conservative, in the sense that not every \(\gamma \in {\mathscr {P}}_{D_s}\) generate an actual sliding mode direction for the systems in \({\mathscr {U}}_1^L\), but \({\mathscr {P}}_{D_s}\) surely contains all of them. \(\blacktriangleleft \)
4.3 Existence of a PDPWQLF
The following Theorem gives the conditions to construct a PDPWQLF of the form (19).
Theorem 1
Let \(\varSigma _1, \ldots , \varSigma _L\) be L extremal systems as defined in (16). Let \(V^1, \ldots , V^L\) be their extremal LFs, each one satisfying the LMIs guaranteeing (12) and (14) and the set of LMIs (25). Let, for any regulatory domain \(D \in {\mathscr {D}}_R\):
in which \(M^{kj}\) is any nonnegative entrywise symmetric matrix, \(\varGamma _D\) is the ray matrix of the homogenization cone \({\hat{C}}_D\) and:
where:
Let \(\sigma ^\lambda \in {\mathscr {U}}_1^L\). Then:
is a PWQLF for \(\sigma ^\lambda \).
Proof
Fix a \(\lambda \in S_L\). The system \(\sigma ^\lambda \) is a PWA system and for \(V^\lambda \) to be a PWQLF for \(\sigma ^\lambda \), it needs to satisfy the constraints (12), (13) and (14).
\(V^\lambda \) is a convex combination of the extremal Lyapunov functions and, given Assumption 1, (14) is naturally satisfied for \(V^\lambda \).
Moreover, given (25), every extremal Lyapunov function is monotone along every sliding direction of \(\sigma ^\lambda \), for any switching domain \(D_s\), because of the construction of \({\mathscr {P}}_{D_s}\), and this guarantee that \(V^\lambda \) satisfies (13) as well. We now only need to prove that (12) is satisfied for \(V^\lambda \) with respect to \(\sigma ^\lambda \). Let D be a regulatory domain of (5). Then:
in which:
We can rewrite (33) as:
Using (34) and the definition of \(\delta f_D^{kj}\), (35) can be written as:
It is easy to show that:
with \( \delta {\tilde{P}}_D^{kj}\) defined by (30), and that:
Given that \(\lambda \in S_L\), it holds:
and so using (37) and (38), Eq. (35) can be written as:
which, given the constraints (29), immediately gives the following:
At this point using the fact that any extremal Lyapunov function \(V^k\) satisfies (12), it follows that also \(V^\lambda \) satisfies (12), proving that \(V^\lambda \) is a PWQLF for \(\sigma ^\lambda \). The same reasoning is valid for any \(\lambda \in S_L\), and this completes the proof. \(\square \)
Remark 6
We refer to the set of LMIs (29) as crossed conditions, as each one of these connects different extremal Lyapunov functions and different extremal systems, inside the same regulatory domain. The need for these conditions is made explicit in equation (39), as the derivative in time of the Lyapunov function \(V_D^\lambda \) is not only dependent on the derivatives in time of the extremal Lyapunov functions, but also on a set of crossed terms, which are guaranteed to be nonpositive if the crossed conditions are satisfied.
These terms are a consequence of the fact that both the system \(\sigma ^\lambda \) and the chosen PDLF \(V^\lambda \) are convex combinations of their extremal counterparts. \(\blacktriangleleft \)
4.4 Extended feasibility problem definition
In the previous Sections we introduced additional LMIs to deal with monotonicity of the PDLF in switching and regulatory domains. Now it is possible to redefine the Feasibility Problem in Pasquini and Angel (2019) [i.e. the set of LMIs that enforce the constraints (12)–(14)] to include these modified conditions. Given the notation and discussions from the previous sections, we aim to solve the following extended feasibility problem.
Problem 1
(Extended feasibility problem) Let \(\varSigma _1, \ldots , \varSigma _L\) be L extremal systems as defined in (16), and consider the associated domain partition, as described in Sect. 3. Find L Piecewise Quadratic (PWQ) functions \(V^k(x)\):
subject to the following constraints:
\(\blacktriangleleft \)
Solving Problem 1 (if feasible) will give L PWQ Lyapunov functions, that when combined as in (32), return a function \(V^\lambda \) that will be referred as a Parameter Dependent PWQ Lyapunov function for the systems in \({\mathscr {U}}_1^L\).
Remark 7
Constraints (42) and (44) are connected to the continuity of extremal LFs in switching domains with sliding modes and along STG cycles. \(\blacktriangleleft \)
Remark 8
The decision variables in Problem 1 are the components of the extremal Lyapunov functions: \(P^k_D\), \(d^k_D\) and \(\omega ^k_D\), for each regulatory domain D, together with the entrywise nonnegative matrices Ms [in constraints (41), (45) and (43)]. Numerical optimization LMI solvers are used to determine a valid solution of this problem e.g. the YALMIP interface (Löfberg 2004) in MATLAB, with the SDPT3 solver. \(\blacktriangleleft \)
Remark 9
The main impact in terms of computational complexity, is connected to switching domains, despite the fact that a switching domain \(D_s\) enters in Problem 1 only if the associated polyhedron \({\mathscr {P}}_{D_s}\), described in (21), is nonempty. In particular the number of switching domains increase exponentially with the size of the network and the number of thresholds, and while the operation of checking whether a polyhedron is empty or not can be performed efficiently, transform a nonempty polyhedron from its Hrepresentation to its Vrepresentation, as it is needed in Problem 1, is a nonpolynomial operation. We recognise this to be a potential drawback of the approach, to be addressed in further research. \(\blacktriangleleft \)
Remark 10
It is reasonable to wonder if results on Lyapunov functions that are valid for hybrid systems transfer, in some way, to the case where the regulation function is smoothly close to its discontinuous counterpart (i.e. when its Hill coefficient is large enough).
Lyapunov functions with strictly negative derivative are robust to sufficiently small perturbations of the dynamics (e.g. by considering it \(C^0\) close to PWA). Despite in our case we do not ask for strict negativity of the derivative, converse Lyapunov results, for differential inclusions (see Forni and Angeli 2017) guarantee existence of Lyapunov functions with strictly negative derivative and therefore affording some kind of robustness with respect to these perturbations. The implications of this are not explored in this context, but are certainly of interest for future research. \(\blacktriangleleft \)
4.5 The setvalued derivative map
We recall and adapt the following definition from Pasquini and Angel (2019).
Definition 1
Let \(V^k\) be a PWQLF for the extremal system \(\varSigma ^k\) as defined in (16), obtained as a solution of Problem 1. Let \(x \in D\). The setvalued map \(\overset{ \circ \,k}{V}(x)\) is defined as:
if \(D \in {\mathscr {D}}_R\), or:
if \(D \in {\mathscr {D}}_S\), with \({\hat{D}}\) being any regulatory domain in R(D), \(\overline{\nabla V^k}_{{\hat{D}}}(x)\) defined as \({\nabla V^k}_{{\hat{D}}}\) on the closure of \({\hat{D}}\), \({\mathscr {P}}_{D}\) being the polyhedron (21) for D, F being defined as in (27) and W being the vertices set of \({\mathscr {P}}_{D}\)’s Vrepresentation [as expressed in (24)]. \(\blacktriangleleft \)
The setvalued map \(\overset{\circ }{V}^k\) is connected to the derivative of \(V^k\) along the system trajectories, through the following Lemma, proved in Pasquini and Angel (2019).
Lemma 1
Consider a PWQLF \(V^k(x)\) for system (16). Let \({\tilde{x}}(\cdot )\) be a solution of (16) on the interval I. Then \({d \over dt}V^k({\tilde{x}}(t))\) is a convex combination of the elements in the set \(\overset{\circ }{V}^k({\tilde{x}}(t))\) for a.e. \(t \in I\).
When we consider a system \(\sigma ^\lambda \in C^1_L\) with polytopic uncertainties, Definition 1 could be naturally extended to the following:
Definition 2
Let \(\sigma ^\lambda \in {\mathscr {U}}_1^L\), with \({\mathscr {U}}_1^L\) defined as in (17), let \(V^1, \ldots , V^L\) be extremal LFs for the extremal systems \(\varSigma _1, \ldots , \varSigma _L\) (obtained as solutions of Problem 1) and let \(V^\lambda \) be the PDPWQLF for \(\sigma ^\lambda \) defined in (32). Let \(x \in D\). The setvalued map \(\overset{ \circ \,\lambda }{V}(x)\) is defined as:
if \(D \in {\mathscr {D}}_R\), where
or:
if \(D \in {\mathscr {D}}_S\), with \({\hat{D}}\) being any regulatory domain in R(D), \(\overline{\nabla V^\lambda }_{{\hat{D}}}(x)\) be defined as \({\nabla V^\lambda }_{{\hat{D}}}\) on the closure of \({\hat{D}}\), \({\mathscr {P}}_{D}\) being the polyhedron (21) for D, F being defined as in (27) and W being the vertices set of \({\mathscr {P}}_{D}\)’s Vrepresentation [as expressed in (24)]. \(\blacktriangleleft \)
Remark 11
The definition of \(\overset{ \circ \,\lambda }{V}\) on switching domains, takes into account the possible sliding mode directions of all the extremal systems, being \({\mathscr {P}}_{D}\) defined as in (21). This choice is conservative, but it is legitimate as it surely contains all directions of interest, and seems necessary due to the fact that the set of sliding mode directions it is not easily described in terms of \(\lambda \). Moreover we remark that for regulatory domains the setvalued map \(\overset{\circ }{V}\) and the function \({\dot{V}}\) are equivalent.\(\blacktriangleleft \)
To complete this section we give a result about some bounds on the elements of the map \(\overset{\circ }{V}\), which will be useful in proving subsequent results.
Corollary 1
Let \(\varSigma _1\), \(\ldots \), \(\varSigma _L\) be L extremal systems as defined in (16) and let \(V^1\), \(\ldots \), \(V^L\) be their extremal LFs. Let the conditions of Theorem 1 be satisfied and let \(V^\lambda \) be the PDPWQLF defined in (19). Let \(D \in {\mathscr {D}}_R\). Then:
Proof
(51) follows from (40) and the fact that \({\dot{V}}\) and \(\overset{\circ }{V}\) are equivalent in regulatory domains. \(\square \)
4.6 Robust convergence properties
It is easy to extend Proposition 1 to prove that a condition like (15) holds for any system \(\sigma ^\lambda \in {\mathscr {U}}_1^L\), i.e.:
However we would like to give results which take into account all the possible realizations of the uncertain system, to state convergence properties which are robust to the polytopic uncertainty.
With respect to the setvalued maps \(\overset{\circ }{V}\) we introduce the following set:
It is remarked that the set \(\varOmega ^+\) can be evaluated for both \(\overset{ \circ \,\lambda }{V}\) and \(\overset{ \circ \,k}{V}\). Consider a \(\lambda \in S_L\) and let \(\overset{ \circ \,\lambda }{V}\) and \(\varOmega ^+\) be defined as in Definition 2 and Eq. (53) respectively. The following intuitive Proposition holds:
Proposition 2
Let \(x(\cdot )\) be a trajectory of system \(\sigma ^\lambda \), let \(V^\lambda \) be a PWQ Lyapunov function for the system, intended as a solution to Problem 1 and let \(\overset{ \circ \,\lambda }{V}\) be the setvalued map defined in Definition 2. Let \(\varOmega ^+(\overset{ \circ \,\lambda }{V},\varepsilon )\) be defined as in (53). Consider an interval \((t_0,t_1)\), with \(t_0 < t_1\) (\(t_1\) could be \(\infty \)). Then:
Proof
By Lemma 1, we know that \({dV^\lambda (x(t)) \over dt} \in \text {conv}\{\overset{ \circ \,\lambda }{V}(x(t))\}\) for a.e. \(t \in (t_0, t_1)\) (and more in general, for a.e. t in the whole interval of definition of the solution \(x(\cdot )\)). Let \({dV^\lambda (x(t)) \over dt} \ge \varepsilon \) and assume, by contradiction, that \(\max \{\overset{ \circ \,\lambda }{V}(x(t))\} < \varepsilon \) (i.e. \(x(t) \notin \varOmega ^+(\overset{ \circ \,\lambda }{V},\varepsilon )\)). Then any element in \(\text {conv}\{\overset{ \circ \,\lambda }{V}(x(t))\}\) would be smaller than \(\varepsilon \), contradicting the fact that \({dV^\lambda (x(t)) \over dt} \ge \varepsilon \). \(\square \)
For \(\varepsilon \rightarrow 0\), the set \(\varOmega ^+(\overset{ \circ \,\lambda }{V},\varepsilon )\) gives information on where the system will converge asymptotically, being in particular an outer approximation of the convergence set, and for this reason its study is of paramount importance. The same set can be defined also for the extremal Lyapunov function \(V^k\), and will be denoted with \(\varOmega ^+(\overset{ \circ \,k}{V},\varepsilon )\). Our goal is to characterize the set \(\varOmega ^+(\overset{ \circ \,\lambda }{V},\varepsilon )\), as \(\lambda \) varies in \(S_L\), in order to guarantee robust convergence result. We are interested in a qualitative analysis, therefore the following definitions are justified.
Definition 3
Consider the extremal system \(\varSigma ^k\) and its extremal Lyapunov function \(V^k\). We call \({\overline{D}}^k_\varepsilon \) the set:
with \({\mathscr {D}} = {\mathscr {D}}_R \cup {\mathscr {D}}_S\). \(\blacktriangleleft \)
Namely \({\overline{D}}^k_\varepsilon \) is the set of domains containing \(\varOmega ^+(\overset{ \circ \,k}{V},\varepsilon )\).
Definition 4
We call \({\overline{D}}_\varepsilon \) the union of the sets \({\overline{D}}^k_\varepsilon \) for all the extremal systems, formally:
\(\blacktriangleleft \)
Definition 5
Consider a system \(\sigma ^\lambda \in {\mathscr {U}}_1^L\) admitting a PDPWQLF \(V^\lambda \). With analogy to Definition 3, we call \({\overline{D}}^\lambda _\varepsilon \) the set:
\(\blacktriangleleft \)
As aformentioned, \({\overline{D}}^\lambda _\varepsilon \) is the set of domains containing at least a point of \(\varOmega ^+(\overset{ \circ \,\lambda }{V},\varepsilon )\). Given that the dependence of \(\varOmega ^+(\overset{ \circ \,\lambda }{V},\varepsilon )\) on \(\lambda \in S_L\) is extremely hard to describe, we aim to define a relation in terms of domains (i.e. the relationship between \({\overline{D}}^k_\varepsilon \), \({\overline{D}}_\varepsilon \) and \({\overline{D}}^\lambda _\varepsilon \)). The following Theorem gives such relationship.
Theorem 2
Let \(\varSigma _1\), \(\ldots \), \(\varSigma _L\) be L extremal systems as defined in (16) and let \(V^1\), \(\ldots \), \(V^L\) be their extremal LFs, obtained as solution of Problem 1. Let \(V^\lambda \) be the PDPWQLF defined in (32). Let \({\overline{D}}_\varepsilon ^\lambda \) and \({\overline{D}}_\varepsilon \) be defined as in Definition 4 and 5. Then:
Proof
Let D be a switching domain, belonging to the set \({\overline{D}}_\varepsilon ^\lambda \). This implies that both \({\mathscr {P}}_D\) and \(\overset{ \circ \,\lambda }{V}(x)\), for \(x \in D\), are nonempty. Let \({\mathscr {P}}_D = \{w_1, \ldots , w_{\nu _\gamma }\}\), \(\overset{ \circ \,\lambda }{V}(x)\) is expressed as:
in which \({\hat{D}}\) is any regulatory domain adjacent to D. Being:
let:
Notice that \(\xi ^{k,j}(x)\) is an element of \(\overset{ \circ \,k}{V}(x)\), for any \(x \in D\) and any \(j \in \{1, \ldots , \nu _\gamma \}\). Since \(D \in {\overline{D}}_\varepsilon ^\lambda \):
Assume, for the sake of contradiction, that \(\xi ^{k,j}(x) < \varepsilon \) for every k, j and \(x \in D\) (i.e. there is no k such that \(D \in {\underline{D}}_\varepsilon ^k \subseteq {\underline{D}}_\varepsilon \)). Because \(\lambda \in S_L\), this yields to:
which contradicts (57), proving that \(D \in {\overline{D}}_\varepsilon \). We now turn to prove the same inclusion for regulatory domains.
Let D be a regulatory domain, belonging to the set \({\overline{D}}_\varepsilon ^\lambda \). Similarly to the previous case, it holds:
From Corollary 1, it follows:
implying that \(\exists k \in \{1, \ldots , L\}\), for which:
proving that \(D \in {\overline{D}}_\varepsilon ^k \subseteq {\overline{D}}_\varepsilon \). This concludes the proof. \(\square \)
Corollary 2
Given the premises of Theorem 2, it holds:
Proof
The fact that:
follows from the fact that any set \({\overline{D}}^k_\varepsilon \) can be obtained by selecting a vertex of the symplex \(S_L\). The fact that:
directly follows from Theorem 2. \(\square \)
As hinted above, the set \({\overline{D}}_\varepsilon \) contains information on the convergence set, for all the systems in \({\mathscr {U}}_1^L\), a fact that will be formalised by Proposition 3 below, but before proceeding to state the proposition and its proof we need to introduce the concept of sink regulatory domains. In particular some regulatory domains have the property that whenever a trajectory enter them, it doesn’t leave. Formally we call sink domain any regulatory domain D, for which \(\varPhi (D) \in D\), where \(\varPhi (D)\) is the focal point of D.
The analysis inside sink domains is trivial (Casey et al. 2006) and to include them in the feasibility problem to be solved does not add any information to the study of convergence. At the same time they restrict the set of feasible extremal Lyapunov functions that satisfy the constraints in Theorem 1, as \(\varPhi (D)\) "moves" with the presence of uncertainties, as the ones described above, in a way that is nearly impossible to capture with a PDPWQLF linear in the extremal LFs. On the other hand a bound on the position of \(\varPhi (D)\) could be easily computed and we know that in D the trajectories will monotonically converge to \(\varPhi (D)\).
For these reasons, we remove from the analysis any sink domain, including them in the convergence set, as a trajectory could always enter (or start in) a sink domain and converge to their focal point.
Proposition 3
Let \(\varSigma _1\), \(\ldots \), \(\varSigma _L\) be L extremal systems as defined in (16) and let \(V^1\), \(\ldots \), \(V^L\) be their extremal LFs, obtained as solution of Problem 1. Let \(\lambda \in S_L\) and let \(V^\lambda \) be the PDPWQLF, as defined in (32), for \(\sigma ^\lambda \in {\mathscr {U}}_1^L\). Let \({\overline{D}}_\varepsilon \) be the set in Definition 4 and let \(\mathscr {SD}\) be the set of sink domains. Let \(x(\cdot )\) be a solution of \(\sigma ^\lambda \) and let D(x(t)) be the function that associates the point x(t) to the domain it belongs. Then:
Proof
From (52) we know that:
Let \(\varOmega ^+(\overset{ \circ \,\lambda }{V},\varepsilon )\) be the set (53) for \(V^\lambda \). It follows easily from Lemma 1 that \({dV^\lambda (x(t)) \over dt} \in \text {conv}\{\overset{ \circ \,\lambda }{V}\}\) for a.e. t and from Proposition 2, it follows that:
where \({\mathscr {T}}\) is a set of times whose measure is finite.
By definition of \({\overline{D}}_\varepsilon \) and Theorem 2, it holds:
The fact that \(V^\lambda (t)\) is absolutely continuous (being the convex combination of absolutely continuous functions—see Pasquini and Angel (2019) implies that the derivative \(dV^\lambda \over dt\) exists almost everywhere. This fact and the property that any sink domain is positively invariant, prove the thesis. \(\square \)
Remark 12
In the proof of Proposition 3 we used the fact that if \(A \subseteq [0,\infty )\) then:
where \(\mu \) is the Lebesgue measure of the set A. \(\blacktriangleleft \)
Remark 13
Proposition 3 states that the trajectories will spend, asymptotically, most of the time in the domains in \({\overline{D}}_\varepsilon \cup \mathscr {SD}\), in the sense that, given a trajectory \(x(\cdot )\), the measure of the set of times spent away from this set, shrinks to 0 as \(t \rightarrow \infty \). \(\blacktriangleleft \)
Remark 14
In this work we considered polytopic uncertainties on the production rates only. However the overall analysis and LMIs framework can be easily adapted to handle uncertainties on the degradation rates only, changing the structure of the matrix \(\delta {\tilde{P}}_D^{kj}\) in (30), or on both the production and degradation rates, by considering all the possible combinations of their extremal values, as vertices of the uncertainty polytope. \(\blacktriangleleft \)
5 Numerical example
Consider the GRN of a two connected feedback loops as in Fig. 6, and consider the following dynamics for the network:
where \(b_1 = 3\), \(b_2 \in [1.3, 1.8]\), \(b_3 \in [2, 6]\), \(c_1 = c_3 = 1\), \(c_2 = 2\) and \(\theta _1 = \theta _2 = \theta _3 = 1\).
System (59) has polytopic uncertainties on the parameters \(b_2\) and \(b_3\), so there are four extremal systems, corresponding to the possible combinations of \(b_2\) and \(b_3\) extrema.
Problem 1 is set up and hence the following constraints will be asked:

1.
Monotonicity of every extremal Lyapunov function inside regulatory domains, together with the crossed conditions connecting couples of extremal Lyapunov functions and extremal systems i.e. constraints (41) and (45);

2.
Monotonicity—and continuity—of every extremal Lyapunov function, in switching domains with nonempty \({\mathscr {P}}_D\) i.e. constraints (42) and (43). In this example, these domains are:
$$\begin{aligned} \begin{aligned} D_{s_1}&= [0, \theta _1) \times \{\theta _2\} \times \{\theta _3\}\\ D_{s_2}&= \{\theta _1\} \times \{\theta _2\} \times (\theta _3, \infty )\\ \end{aligned} \end{aligned}$$ 
3.
Continuity of the extremal Lyapunov functions along the cycles in the STG of the network, which converts into asking continuity on the walls connecting the domains \(D_5\), \(D_6\), \(D_7\) and \(D_8\), relatively to the partition in Fig. 7, as per constraints (44).
We can notice that the regulatory domain:
is a sink domain, and for this reason it is removed from the formulation of Problem 1.
By solving Problem 1, it is possible to find four extremal Lyapunov functions, from which we can construct a PDLF \(V^\lambda \). In Fig. 8 some trajectories are shown for different realizations of the uncertainty and in Fig. 9 it is shown how the parameter dependent Lyapunov function \(V^\lambda \), is eventually nonincreasing along these trajectories. More numerical details on the LMI formulation and potential solution are given in the “Appendix”
Choosing \(\varepsilon = 10^{7}\), it is possible to find the sets \({\overline{D}}_\varepsilon ^k\), for all the extremal Lyapunov functions \(V^k\), and consequently we can determine the set \({\overline{D}}_\varepsilon \), corresponding to:
where:
Given the cyclic nature of the system trajectories around \(D_{s_2}\), and because \(\overset{ \circ \,k}{V}(x)\), for each extremal LF, approach 0 as x tends to \(D_{s_2}\), the set \({\overline{D}}_\varepsilon \) contains also the regulatory domains adjacent to \(D_{s_2}\) (i.e. \(\{D_5, \ D_6, \ D_7, \ D_8\}\)).
However from the proof of Theorem 2, it follows:
so that, by studying the set where:
we can infer that the solutions always converge, in the sense of measure, to the domain \(D_{s_2}\). This is also a consequence of the fact that \(\overset{ \circ \,k}{V}\) is described, in the regulatory domains around \(D_{s_2}\), by nonsingular quadratic forms, and it is empty in the boundaries connecting these regulatory domains. To give a visual idea of the result, in Fig. 10, different level sets of the function \(\max \limits _{k \in \{1, \ldots L\}} \{\overset{ \circ \,k}{V}(x)\}\) in the region \(x_3 > \theta _3\) are shown, with decreasing values of \(\varepsilon \). The projection on \((x_1,x_2)\) is considered, as \(V^\lambda \) does not depend on \(x_3\) in those particular regulatory domains.
This analysis is supported by the trajectories represented in Fig. 11, where the highlighted cyan domain is \(D_{s_2}\), to which we can see that most of the trajectories converge. It should be noticed that, for the same initial condition \(x_0 = \begin{bmatrix} 3&1.1&0.5\end{bmatrix}^T\), the system may converge to the switching domain \(D_{s_2}\) or to the sink domain \(D_2\), depending on the uncertainty realization.
Remark 15
In Casey et al. (2006), a conjecture—proved true in Wang and Wang (2013) – is given with sufficient conditions for the weak asymptotic stability of a switching domain \(D_s\), under the assumption that no cycles are present in the STG reduced to the neighbours of such switching domain. In the case of the above example however, the domain \(D_{s_2}\) has two cycles involving neighbour domains, hence the result of Casey et al. (2006) and Wang and Wang (2013) cannot be applied. \(\blacktriangleleft \)
6 Conclusion
Due to contextdependence and measurement limitations, models of biological systems are affected by parameter uncertainties and different kind of disturbances. In this chapter we considered a PWA model of genetic regulatory networks, and assumed the presence of polytopic uncertainties affecting the production rates. The LMI framework of Pasquini and Angel (2019) has been extended, allowing to determine a Parameter Dependent Piecewise Quadratic Lyapunov function, for the whole polytope of uncertain parameters. With this function we can conclude on the convergence properties of the trajectories to a particular set of domains, independently from the values assumed by the perturbed parameters. This can rule out a big chunk of the positive orthant from the convergence set, with further analysis that can be done in the resulting convergence set, to better characterise the system dynamics. In fact, as has been done in the double feedback example, the study of the level sets for the derivative map can allow to conclude more precise results on the system convergence.
These results can guide both in the synthesis of denovo genetic circuits and in predicting the behavior of natural ones.
However there are a couple of issues in the analysis, that deserve to be addressed in future research. Firstly, as already addressed in Remark 3, Assumption 1 considers that the thresholds are unchanged among the extremal systems, which we recognize to be unrealistic. An extension of the framework, to allow polytopic uncertainties in the thresholds—e.g. by giving a lower and an upperbound on each \(\theta \)—would certainly be of interest. However this would require a significant structural change of the framework, as continuity constraints would need to be applied on an undefined threshold, with their convexification leading to nonlinear conditions, moving away from an LMI setup. If one chooses to drop any continuity constraint instead, the entire theoretical scaffolding should be changed, as infinite jumps of the Lyapunov functions would now be allowed, while at the same time, entry and exit points of sliding modes on the surface of discontinuity should be taken into account. These matters should be investigated in future research.
Secondly the constraints relative to the monotonicity of the Lyapunov function along sliding mode can be very conservative, and extremely expensive even to define. This is due to the fact that it is difficult to characterise the set of sliding directions in terms of the uncertain parameters, hence we need to impose this condition on all possible sliding directions, for all extremal systems. A better characterisation of this set—and the consequent relaxation of the LMI conditions—would increase the set of feasible solutions, while decreasing the computational cost of the approach.
In connection with this latter point, and Remark 9, general efficiency of the framework implementation should be pursued as many Genetic Regulatory Networks in nature are composed of tens of nodes. The framework described here can easily handle networks of up to six or seven nodes, but the computational cost becomes prohibitive after that. This work should be in fact considered as a proof of concept, and we believe that there are many possibilities to increase its efficiency.
Ultimately, future works should also consider control applications of the analytical results given above. Of particular interest is the problem of invivo control of Genetic Regulatory Networks, namely the addition, to the original GRN, of a second network whose goal is to obtain a desired overall behavior (e.g. control of an unstable steady state). With the current framework one could attempt a trial and error approach, meaning that a structure for the controlnetwork can be chosen, the overall convergence properties studied through the described Lyapunov approach, and the control network modified accordingly, until the desired behavior is reached. We recognize that this approach is extremely inefficient and the possibility of embedding the control problem into a complementary set of LMIs should be addressed in future research.
References
Ali AlRadhawi M, Angeli D (2016) New approach to the stability of chemical reaction networks: piecewise linear in rates Lyapunov functions. IEEE Trans Autom Control 61(1):76–89
Alon U (2007) An introduction to systems biology: design principles of biological circuits, vol 10. Mathematical and computational biology series. Chapman&Hall/CRC, Boca Raton
Arcak M, Sontag ED (2008) A passivitybased stability criterion for a class of biochemical reaction networks. Math Biosci Eng 5(1):1
Avis D, Fukuda K, Picozzi S (2002) On canonical representations of convex polyhedra. In: Proceedings of the first international congress of mathematical software. pp 350–360
Blanchini F, Giordano G (2014) Piecewiselinear Lyapunov functions for structural stability of biochemical networks. Automatica 50(10):2482–2493
Blanchini F, EISamad H, Giordano G, Sontag ED (2018) Controltheoretic methods for biological networks. In: 2018 IEEE 57th annual conference on decision and control, CDC 2018. pp 466–483
Casey R, De Jong H, Gouzé JL (2006) Piecewiselinear models of genetic regulatory networks: equilibria and their stability. J Math Biol 52(1):27–56
Chesi G, Hung YS (2008) Stability analysis of uncertain genetic sum regulatory networks. Automatica 44(9):2298–2305
Chesi G, Garulli A, Tesi A, Vicino A (2004) Parameterdependent homogeneous Lyapunov functions for robust stability of linear timevarying systems. In: 2004 43rd IEEE conference on decision and control (CDC), vol 4. pp 4095–4100
Chesi G, Garulli A, Tesi A, Vicino A (2005) Polynomially parameterdependent Lyapunov functions for robust stability of polytopic systems: an LMI approach. IEEE Trans Autom Control 50(3):365–370
Collins JJ, Gardner TS, Cantor CR (2000) Construction of a genetic toggle switch in Escherichia coli. Nature 403:339–342
Cummins B, Gedeon T, Harker S, Mischaikow K, Mok K (2016) Combinatorial representation of parameter space for switching networks. SIAM J Appl Dyn Syst 15(4):2176–2212
De Jong H, Geiselmann J, Hernandez C, Page M (2003) Genetic network analyzer: qualitative simulation of genetic regulatory networks. Bioinformatics 19(3):336–344
De Jong H, Gouzé J, Hernandez C, Page M, Sari T, Geiselmann J (2004) Qualitative simulation of genetic regulatory networks using piecewiselinear models. Bull Math Biol 66(2):301–340
Filippov AF (1988) Differential equations with discontinuous righthand sides. Kluwer Academic Publishers, Dordrecht
Forni P, Angeli D (2017) Smooth Lyapunov functions for multistable hybrid systems on manifolds. In: 2017 IEEE 56th annual conference on decision and control (CDC). IEEE, pp 5481–5486
Freeman S (2014) Biological science, 4th edn. Pearson, London
Gahinet P, Apkarian P, Chilali M (1996) Affine parameterdependent Lyapunov functions and real parametric uncertainty. IEEE Trans Autom Control 41(3):436–442
Gedeon T (2020) Multiparameter exploration of dynamics of regulatory networks. Biosystems 190:104113
Glass L, Kauffman SA (1973) The logical analysis of continuous, nonlinear biochemical control networks. J Theor Biol 39(1):103–129
Grognard F, de Jong H, Gouzé JL (2007) Piecewiselinear models of genetic regulatory networks: theory and example. Springer, Berlin Heidelberg, pp 137–159
Herceg M, Kvasnica M, Jones CN, Morari M (2013) Multiparametric toolbox 3.0. In: Proceedings of the European control conference. Zürich, Switzerland, pp 502–510
Iervolino R, Tangredi D, Vasca F (2017a) Lyapunov stability for piecewise affine systems via conecopositivity. Automatica 81:22–29
Iervolino R, Trenn S, Vasca F (2017b) Stability of piecewise affine systems through discontinuous piecewise quadratic Lyapunov functions. In: 2017 IEEE 56th annual conference on decision and control. CDC 2017. Melbourne, VIC, Australia, pp 5894–5899
Karlebach G, Shamir R (2008) Modelling and analysis of gene regulatory networks. Nat Rev Mol Cell Biol 9(10):770–780
Khalil HK (2002) Nonlinear systems, 3rd edn. Pearson Education, Prentice Hall
Le Novère N (2015) Quantitative and logic modelling of molecular and gene networks. Nat Rev Genet 16(3):146–58
Liberzon D (2003) Switching in systems and control. Springer, Berlin
Lin H, Antsaklis PJ (2005) Stability and stabilizability of switched linear systems: a short survey of recent results. In: Proceedings of the 2005 IEEE international symposium on, mediterrean conference on control and automation intelligent control, 2005. IEEE, pp 24–29
Lin H, Antsaklis PJ (2007) Switching stabilizability for continuoustime uncertain switched linear systems. IEEE Trans Autom Control 52(4):633–646
Löfberg J (2004) Yalmip: A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD conference, Taipei, Taiwan
Murray RM, Del Vecchio D (2014) Biomolecular feedback systems. Princeton University Press, Princeton
Neto AT (1999) Parameter dependent Lyapunov functions for a class of uncertain linear systems: an LMI approach. In: Proceedings of the 38th IEEE conference on decision and control (Cat. No.99CH36304), vole 3. pp 2341–2346
Oliveira RCLF, Peres PLD (2006) LMI conditions for robust stability analysis based on polynomially parameterdependent Lyapunov functions. Syst Control Lett 55(1):52–61
Pasquini M, Angeli D (2018) On piecewise quadratic Lyapunov functions for piecewise affine models of gene regulatory networks. In: 2018 IEEE 57th annual conference on decision and control. CDC 2018. Miami Beach, FL, USA. pp 1071–1076
Pasquini M, Angeli D (2019) On convergence for piecewise affine models of gene regulatory networks via a Lyapunov approach. IEEE Trans Autom Control 65:3333–3348
Plahte E, Mestl T, Omholt SW (1998) A methodological basis for description and analysis of systems with complex switchlike interactions. J Math Biol 36(4):321–348
Qian Y, McBride C, Del Vecchio D (2018) Programming cells to work for us. Annu Rev Control Robot Autonom Syst 1(1):411–440
Ropers D, de Jong H, Page M, Schneider D, Geiselmann J (2006) Qualitative simulation of the carbon starvation response in Escherichia coli. BioSystems 84(2):124–152
Saadatpour A, Albert R (2016) A comparative study of qualitative and quantitative dynamic models of biological regulatory networks. EPJ Nonlinear Biomed Phys 4(5):1–13
Tiernan JC (1970) An efficient search algorithm to find the elementary circuits of a graph. Commun ACM 13(12):722–726
Toh KC, Todd MJ, Tütüncü RH (1999) Sdpt3a MATLAB software package for semidefinite programming, version 1.3. Optim Methods Softw 11(1–4):545–581
Tournier L, Chaves M (2009) Uncovering operational interactions in genetic networks using asynchronous Boolean dynamics. J Theor Biol 260(2):196–209
Wang J, Wang L (2013) State transition graph and stability of singular equilibria for piecewise linear biological models. Physica D Nonlinear Phenom 246(1):39–49
Zhai G, Lin H, Antsaklis PJ (2003) Quadratic stabilizability of switched linear systems with polytopic uncertainties. Int J Control 76(7):747–753
Funding
Open access funding provided by Royal Institute of Technology. This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC), under award 1895642, and in part by the Department of Electrical and Electronic Engineering at Imperial college of London.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflicts of interest
The authors declare that there is no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) and the Department of Electrical and Electronic Engineering at Imperial College of London.
Appendix: Numerical details for the example of section 5
Appendix: Numerical details for the example of section 5
The positive orthant partition of system (59) gives rise to the following regulatory domains:
Given the uncertainty on \(b_2\) and \(b_3\), the following four extremal systems can be defined:
where \(b_1 = 3\), \(b_2^ = 1.3\), \(b_2^+ = 1.8\), \(b_3^ = 2\), \(b_3^+ = 6\), \(c_1 = c_3 = 1\), \(c_2 = 2\) and \(\theta _1 = \theta _2 = \theta _3 = 1\).
Conditions (41) and (45), on the monotonicity inside regulatory domains and crossed conditions respectively, should be asked for each regulatory domain (with the only exception of the sink domain \(D_2\)) and each extremal Lyapunov function. Consider for example the domain \(D_1\) and the first extremal Lyapunov function \(V_1\). Condition (41) converts to:
where \(\varGamma _{D_1}\) is the ray matrix of the homogenization cone \({\mathscr {C}}_{D_1}\), which can be constructed as in Eq. (3), in this case:
while \({\tilde{P}}^1_{D_1}\) is:
for which \({\mathbf {P}}^{{\mathbf {1}}}_{{\mathbf {D}}_{\mathbf {1}}}\) and \({\mathbf {d}}^{{\mathbf {1}}}_{{\mathbf {D}}_{\mathbf {1}}}\) are decision variables, while:
\(M^1_{D_1}\) is another decision variable of the problem, with the only constraints that its elements are all nonnegative. An LMI interpreter (such as Yalmip Löfberg 2004 in MATLAB) with a semidefinite programming solver (such as SDPT3 Toh et al. 1999) can be used to impose this kind of constraints and search for a solution. In regards to (45), consider for example the crossed conditions between the first and the second extremal Lyapunov functions (i.e. \(V_1\) and \(V_2\)), for the regulatory domain \(D_4\). This converts to:
where:
while:
where, as previously, \({\mathbf {P}}^{\mathbf {2}}_{{\mathbf {D}}_{\mathbf {4}}}\), \({\mathbf {P}}^{\mathbf {1}}_{{\mathbf {D}}_{\mathbf {4}}}\), \({\mathbf {d}}^{\mathbf {1}}_{{\mathbf {D}}_{\mathbf {4}}}\), \({\mathbf {d}}^{\mathbf {2}}_{{\mathbf {D}}_{\mathbf {4}}}\) and \(M_{D_4}^{12}\) are decision variables, while:
We remark that conditions (68) and (69) are asked for all regulatory domains (except \(D_2\)) and all extremal Lyapunov functions (with the crossed conditions, asked for any possible couple of extremal Lyapunov functions).
For switching domains the first step is to check if, for any given \(D_S\), the polyhedron \({\mathscr {P}}_{D_S}\) described in Eq. (21) is nonempty. This operation can be done efficiently using available software libraries for polyhedra (e.g. MPT3 Herceg et al. 2013). In this case the only two switching domains with such properties are:
The Hrepresentation (21) of the polyhedron \(P_{D_S}\), is then converted to its V  representation, and again this operation can be performed using dedicated software toolboxes (e.g. MPT3). Condition (43) is then asked, for all vertices in such Vrepresentation and all extremal systems. It is remarked that the polyhedron \({\mathscr {P}}_{D_S}\) is independent of the particular extremal Lyapunov function, by construction.
Moreover for the two switching domains, continuity of the extremal Lyapunov functions is asked. Consider for example the switching domain \(D_{S_2}\) and the first extremal LF. Condition (42) converts to:
where:
while \(\overline{P^1_{D}}\) is the matrix:
Condition (70) should be asked for all D and \(D'\) belonging to \(R(D_{S_2})\), i.e. the set of regulatory domains that have \(D_{S_2}\) in their boundaries, in this case:
Condition (70) is then asked for all extremal Lyapunov functions and for all the other switching domains with nonempty \({\mathscr {P}}_{D_S}\), in this case only \(D_{S_1}\).
Ultimately the conditions on continuity along cycles of the STG should be asked. Given the STG (which can be obtained through the algorithm explained in De Jong et al. 2004), we can search for all the cycles in it using efficient algorithms (see for example Tiernan 1970), and for each cycle ask for the extremal Lyapunov functions to be continuous on the switching domains which will eventually be crossed. In this case this converts to asking for the extremal Lyapunov function to be continuous on the walls connecting the regulatory domains \(D_5\), \(D_6\), \(D_7\) and \(D_8\). Consider for example the wall between \(D_5\) and \(D_6\), for the extremal Lyapunov function \(V_1\). The continuity condition becomes:
where \(D_{56}\) is the wall between \(D_5\) and \(D_6\), while:
This type of condition is repeated for the remaining walls and for all other extremal Lyapunov functions.
Once all the LMIs and matrix equalities are collected, the feasibility problem can be solved (with the aforementioned software) and a description of the parameter dependent Lyapunov function (in terms of the variables \(\mathbf {P^k_D}\), \(\mathbf {d^k_D}\) and \(\mathbf {\omega ^k_D}\) for all regulatory domains D, for all extremal Lyapunov functions \(V^k\)). As an example, below the description of the first extremal Lyapunov function:
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Pasquini, M., Angeli, D. On convergence for hybrid models of gene regulatory networks under polytopic uncertainties: a Lyapunov approach. J. Math. Biol. 83, 64 (2021). https://doi.org/10.1007/s00285021016903
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00285021016903
Keywords
 Gene regulatory networks
 Lyapunov methods
 Linear matrix inequalities
 Convergence analysis
 Systems biology
 Polytopic uncertainties