Complexity

Complexity / 2019 / Article

Research Article | Open Access

Volume 2019 |Article ID 2731395 | 8 pages | https://doi.org/10.1155/2019/2731395

Robust Invariant Set Analysis of Boolean Networks

Academic Editor: Carlos Gershenson
Received18 Aug 2018
Revised23 Dec 2018
Accepted14 Jan 2019
Published03 Feb 2019

Abstract

In this paper, the robust invariant set (RIS) of Boolean (control) networks with disturbances is investigated. First, for a given fixed point, consider a special set called immediate neighborhoods of the fixed point; then a discrete derivative of Boolean functions at the fixed point is used to analyze the robust invariance, based on which a sufficient condition is obtained. Second, for more general sets, the robust output control invariant set (ROCIS) of Boolean control networks (BCNs) is investigated by semitensor product (STP) of matrices. Then, under a given output feedback controller, we obtain a necessary and sufficient condition to check whether a given set is robust control invariant set (RCIS). Furthermore, output feedback controllers are designed to make a set to be a RCIS. Finally, the proposed methods are illustrated by a reduced model of the lac operon in E. coli.

1. Introduction

In 1969, Kauffman [1] firstly used Boolean networks (BNs), which are a kind of logical networks to study genetic regulatory networks. Then, BNs have attracted extensive attention and have become abstract modeling schemes in other different fields such as neural networks [2] and immune response [3]. In BNs, each gene expression has two states as “1” and “0” to represent “on” and “off,” respectively. Moreover, interactions between the states of each gene depend on Boolean functions, which are composed of logical operators such as disjunction and conjunction and so on. The state evolution for each gene is updated by a Boolean function about the states of current neighborhoods.

When control inputs are added into BNs, then BNs can be called BCNs. Similarly, control inputs take two values: “0” implies that the application of that intervention is ceased at that time point, and “1” means that some interventions are applied in BNs. A new matrix product called semitensor product (STP) of matrices was proposed to investigate BNs and BCNs [4]. Based on this, a BN (or BCN) can be converted into the corresponding algebraic form by calculating its unique transition matrix. Therefore, many fundamental and interesting problems have been investigated for BNs and BCNs, such as the controllability [5, 6], stabilization [715], observability [1619], disturbance decoupling problem [20] synchronization [21], function perturbations [22], optimal control [2326], normalization problem [27], and others. The STP has also been widely applied in games [28, 29] and asynchronous sequential machines [30, 31]. In detail, [28] investigated the evolutionarily stable strategy of finite evolutionary networked games by STP and then designed event-triggered controllers such that systems could converge globally. In [29], the stochastic set stabilization of random evolutionary Boolean games was further investigated, and a constructive algorithm was proposed to calculate stochastic reachable sets. On the other hand, [30] and [31] investigated the reachability and skeleton matrix by STP, respectively.

Usually, some external disturbance inputs always exist in systems. For example, cancer can be defined as failures in the healthy mechanisms of biological systems, and it has been classified as a kind of genetic uncertainties consisting of mutations [32]. Therefore, designing controllers is of great importance such that the set of desirable cellular states of BCNs with disturbance inputs is robust. In other words, if the trajectories of BCNs with some initial states reach a given set, which is called robust control invariant set (RCIS) [33], then those trajectories will never leave the set no matter what disturbances are. The RCIS has attracted many scholars’ attention and obtained many results [3437]. In [33], Li et al. used STP to study the RCIS of BCNs and presented an effective procedure to design state feedback controllers. However, due to the limitation of measurement conditions and the impact of immeasurable variables, measured output information rather than state information is always used to analyze and control systems [38]. Therefore, we will design output feedback controllers such that the trajectories of BCNs starting from some initial states in a given set will never leave the given set, which is called robust output control invariant set (ROCIS). On the other hand, Robert analyzed the local convergence of BNs by the discrete derivative of Boolean functions at a fixed point [39], which is a novel approach to investigate BNs. Motivated by this, we use the discrete derivative method to investigate the RIS, which makes the computational complexity reduced compared with STP. To the best of our knowledge, there is no result concerning the ROCIS of BCNs. The contributions of this paper are listed as follows:(i)The discrete derivative is used to analyze the robust invariance.(ii)A necessary and sufficient condition is derived to check whether a given set is ROCIS under a given output feedback controller.(iii)Output feedback controllers are designed to make a given set be a ROCIS.

The rest of this paper is organized as follows. Section 2 reviews some notations and preliminary results, which will be used in the latter. Section 3 presents the main results. Section 4 ends the paper with a brief conclusion.

2. Preliminaries

In this section, we give some necessary properties of the STP and list some useful notations.(i)Let be the set for integers .(ii)Denote by matrix the set of real matrices.(iii)Set , where is the -th column of identity matrix .(iv)Let stand for the -th column of the matrix B.(v)Matrix is called a logical matrix, and simply denote it by .(vi)Let denote the row vector of length with all entries being .

Definition 1 ([4]). For any given two matrices and , the STP of and is defined as where is the least common multiple of and and is the Kronecker product.

Proposition 2 ([4]). Let be a column and be any matrix. Then

Definition 3 ([40]). Let . Then, the Khatri-Rao product is defined as

The notation represents that when the two values denoted by and taking from are the same, then . Otherwise, the result equals .

A logical domain, denoted by is defined as , and . If identifying and , then , and , where “” represents two different forms of the same object. If , then we say is in a scalar form. If , we say is in a vector form. In the sequel, to distinguish the scalar form and the vector form of a variable, we use the notation for a variable in , while we use the notation for its vector variable in . In short, , but .

The following lemma is important for the algebraic expressions of logical functions.

Lemma 4 ([4]). Consider a logical function . There exists a unique matrix , called the structure matrix of , such that where .

For example, the structure matrix of logical function is . And the structure matrix of logical function is .

Definition 5. Assume that there are -dimensional row vectors and , , , , respectively. The distance vector denoted by between and is defined; that is, .

Assume that , and then define a bijection [4], wherewith . Furthermore, we can also define , wherewith and ,

For example, assume that ; then, by (5), one has that .

3. Main Results

We consider the following system with disturbance inputs:where and . is a logical function.

For each , there exists a unique structure matrix , by Lemma 4. Let and , then system (7) can be converted into the following forms: where and . Multiplying all the equations in (8) together, we getwhere with is the Khatri-Rao product [40]. Split into equal blocks denoted by , and then one has

Given a state denoted by , we denote the immediate neighborhoods of by [39]; that is, where represents the -th column of identify matrix . For example, assume that , and then, based on the above definition, one has that . Assume that , where , . Let .

Definition 6. Assume that two -dimensional Boolean row vectors and . We say that if, for any , .

For example, there are two vectors as and . We have , and , and then .

Definition 7. Consider system (7), and assume that is one of the fixed points for any disturbance. If, for any and disturbance input , , then is said to be a RIS.

Definition 8 ([39]). Consider system (7) with disturbance inputs. For any given state and when , the discrete derivative of Boolean functions at state , denoted by , is an Boolean matrix with its elements given as follows: or

Based on Definition 8, we further define another Boolean matrix; that is, It can be learned from the construction of that for any , , and , we get

Theorem 9. Consider system (7) with the fixed point for any disturbance. If has at most one 1 in each column, then is a RIS.

Proof. If each column of can only be zero vector or a basis vector, then it can be learned from (15) that the state can be guaranteed in the set beginning from any initial state , , in every step, which completes the proof.

Example 10. Consider a BN with the fixed point being (1, 1) for any disturbance:One has and . Let and , respectively, and we can get and Therefore, Since and , then Theorem 9 holds. Therefore, is a RIS.

Remark 11. It is learned from Theorem 9 that matrix with dimension (not ) can be constructed, based on which the RIS is analyzed. Therefore, compared with the results obtained by STP in [35], the computational complexity is reduced from to . Unfortunately, the method of discrete derivative can only be used to analyze some special systems in the form of (7). In the sequel, we will further analyze more general sets and design output feedback controllers such that the set is robust for any disturbance inputs.

In the following, consider a BCN with nodes, outputs, disturbance inputs, and inputs aswhere and are logical functions, , .

Then, the definition of a ROCIS of BCNs is presented as follows.

Definition 12. Consider system (20). A nonempty set is said to be a ROCIS, if there exists an output feedback control aswhere are Boolean functions such that, for the closed-loop system consisting of (20) and (21), implies .

It can be learned from Lemma 4 that we can find unique structure matrices , , and for logical functions , , and in (20) and (21), respectively, , . Then the equivalent forms of (20) and (21) areandrespectively, where , , , and .

Multiply the equations in (22), and (23), respectively; then (20) and (21) can be converted into the following forms:andrespectively, and , , and .

Assume that a given nonempty set with , and we analyze the following two problems:(i)Problem 1: For a given output feedback matrix , analyze whether the set is a ROCIS of system (20) under control system .(ii)Problem 2: Design output feedback controllers such that is a ROCIS of system (20).

Plug (25) into (24), then one has that where , and is the power-reducing matrix satisfying .

Split into equal blocks as where , , and then it follows from (26) thatTherefore, based on Definition 12, we have the following result.

Theorem 13. For a given set and an output feedback gain matrix , set is a ROCIS of system (20) under the output feedback control if and only if, for any , , and then .

Proof. It is easy to see that the sufficiency holds, and we only need to prove the necessity. Consider (28); since is a ROCIS of system (20) under the output feedback control , then, for any , , and any , one hasFrom the arbitrariness of and , the conclusion holds.

Remark 14. As mentioned above that set is equivalent to . Based on STP, the algebraic expression of system (20) can be obtained. Therefore, it will be better to write set in vector form in Theorem 13 compared with Definition 12.

In the following, we discuss Problem 2, and then controller (25) will be designed. Suppose that and , which will be designed. On one hand, for system (26) with , , and , one has that On the other hand, we define the following sets: Obviously, . For each , and then denote

For any integer , defineFor each , we construct a set, denoted by , asThen, the result about the existence of output feedback controllers can be obtained.

Theorem 15. is a ROCIS of system (20) by an output feedback control, if and only if, for any , ,Moreover, if (36) holds, then output feedback matrices under which is a ROCIS are constructed as with

Proof. (Sufficiency): Suppose that (36) holds. We construct controller (37). Then, for , one has Moreover, for any , , and , , we have that , and then it can be learned from (34) that , for all . Therefore, is a ROCIS of system (20).
(Necessity): Suppose that is a ROCIS of system (20) with control , and then, for any , , one can obtain that , , which means that (36) holds.
In fact, if (36) does not hold, then there exists an integer such that . In this case, it can be learned from (35) that and . Assume that , i.e., , then we have . Since is a ROCIS of system (20) with control , then , which is a contradiction to . As a result, for any , .

Example 16. Let us consider a reduced model of the lac operon in E. coli [33, 41]:where , and are state variables denoting the lac mRNA, the lactose in high concentrations, and the lactose in medium concentrations, respectively; , and are inputs variables representing the extracellular lactose, the high extracellular lactose, and the medium extracellular lactose, respectively; is an external disturbance. The output equations are given by And the robust set .
Obviously, , and then . Let , , and , and then we have where and In this example, one can get , and , and then we have and . Therefore, , and . From (34), we have , which means that , and . By Theorem 15, is a ROCIS of system 40a and 40b with the disturbance , and the output feedback gain matrices are with , , and , . For example, let , , and , and then the corresponding output feedback control is

4. Conclusion

In this paper, the RIS of BNs (BCNs) with disturbances was investigated. A special set called immediate neighborhood of a given fixed point was considered; then the discrete derivative of Boolean functions at the fixed point was used to analyze the robust invariance; based on this a sufficient condition was obtained. Furthermore, the ROCIS of BCNs was considered by STP. A necessary and sufficient condition was obtained to check whether a given set is RCIS under a given output feedback controller. Finally, for a given set, output feedback controllers were designed such that the set is RCIS.

Data Availability

The data used to support the findings of this study are included within the article.

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This work was partially supported by the National Natural Science Foundation of China under Grant nos. 11671361 and 61573008, the China Postdoctoral Science Foundation under Grant nos. 2015M580378 and 2016T90406, and the Zhejiang Provincial Natural Science Foundation of China under Grant No. LD19A010001, and the National Training Programs of Innovation and Entrepreneurship under Grants 201610345020 and 201710345009.

References

  1. S. A. Kauffman, “Metabolic stability and epigenesis in randomly constructed genetic nets,” Journal of Theoretical Biology, vol. 22, no. 3, pp. 437–467, 1969. View at: Publisher Site | Google Scholar
  2. L. Wang, E. E. Pichler, and J. Ross, “Oscillations and chaos in neural networks: An exactly solvable model,” Proceedings of the National Acadamy of Sciences of the United States of America, vol. 87, no. 23, pp. 9467–9471, 1990. View at: Publisher Site | Google Scholar
  3. S. A. Kauffman and E. D. Weinberger, “The NK model of rugged fitness landscapes and its application to maturation of the immune response,” Journal of Theoretical Biology, vol. 141, no. 2, pp. 211–245, 1989. View at: Publisher Site | Google Scholar
  4. D. Cheng, H. Qi, and Z. Li, Analysis and Control of Boolean Network: A Semi-Tensor Product Approach, Springer, London, UK, 2010. View at: Publisher Site | MathSciNet
  5. D. Laschov and M. Margaliot, “Controllability of Boolean control networks via the Perron-Frobenius theory,” Automatica, vol. 48, no. 6, pp. 1218–1223, 2012. View at: Publisher Site | Google Scholar | MathSciNet
  6. J. Lu, J. Zhong, C. Huang, and J. Cao, “On pinning controllability of Boolean control networks,” Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol. 61, no. 6, pp. 1658–1663, 2016. View at: Publisher Site | Google Scholar | MathSciNet
  7. R. Li, M. Yang, and T. Chu, “State feedback stabilization for Boolean control networks,” Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol. 58, no. 7, pp. 1853–1857, 2013. View at: Publisher Site | Google Scholar | MathSciNet
  8. M. Meng, J. Lam, J.-e. Feng, and K. . Cheung, “Stability and guaranteed cost analysis of time-triggered Boolean networks,” IEEE Transactions on Neural Networks and Learning Systems, vol. 29, no. 8, pp. 3893–3899, 2018. View at: Publisher Site | Google Scholar | MathSciNet
  9. Y. Yu, M. Meng, J.-e. Feng, and P. Wang, “Stabilizability analysis and switching signals design of switched Boolean networks,” Nonlinear Analysis: Hybrid Systems, vol. 30, pp. 31–44, 2018. View at: Publisher Site | Google Scholar | MathSciNet
  10. F. Li and Y. Tang, “Set stabilization for switched Boolean control networks,” Automatica, vol. 78, pp. 223–230, 2017. View at: Publisher Site | Google Scholar | MathSciNet
  11. S. Zhu, J. Lou, Y. Liu, Y. Li, and Z. Wang, “Event-Triggered Control for the Stabilization of Probabilistic Boolean Control Networks,” Complexity, vol. 2018, pp. 1–9, 2018. View at: Publisher Site | Google Scholar
  12. J. Lu, L. Sun, Y. Liu, D. W. Ho, and J. Cao, “Stabilization of Boolean CONtrol Networks Under Aperiodic Sampled-Data CONtrol,” SIAM Journal on Control and Optimization, vol. 56, no. 6, pp. 4385–4404, 2018. View at: Publisher Site | Google Scholar | MathSciNet
  13. Y. Mao, L. Wang, Y. Liu, J. Lu, and Z. Wang, “Stabilization of evolutionary networked games with length-rinformation,” Applied Mathematics and Computation, vol. 337, pp. 442–451, 2018. View at: Publisher Site | Google Scholar | MathSciNet
  14. L. Tong, Y. Liu, J. Lou, J. Lu, and F. E. Alsaadi, “Static output feedback set stabilization for context-sensitive probabilistic Boolean control networks,” Applied Mathematics and Computation, vol. 332, pp. 263–275, 2018. View at: Publisher Site | Google Scholar | MathSciNet
  15. L. Tong, Y. Liu, Y. Li, J. Lu, Z. Wang, and F. E. Alsaadi, “Robust control invariance of probabilistic boolean control networks via event-triggered control,” IEEE Access, vol. 6, pp. 37767–37774, 2018. View at: Publisher Site | Google Scholar
  16. D. Laschov, M. Margaliot, and G. Even, “Observability of Boolean networks: a graph-theoretic approach,” Automatica, vol. 49, no. 8, pp. 2351–2362, 2013. View at: Publisher Site | Google Scholar | MathSciNet
  17. D. Cheng and H. Qi, “Controllability and observability of Boolean control networks,” Automatica, vol. 45, no. 7, pp. 1659–1667, 2009. View at: Publisher Site | Google Scholar | MathSciNet
  18. K. Zhang and L. Zhang, “Observability of Boolean control networks: a unified approach based on finite automata,” Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol. 61, no. 9, pp. 2733–2738, 2016. View at: Publisher Site | Google Scholar | MathSciNet
  19. Q. Zhu, Y. Liu, J. Lu, and J. Cao, “Observability of Boolean control networks,” Science China Information Sciences, vol. 61, no. 9, 092201, 12 pages, 2018. View at: Publisher Site | Google Scholar | MathSciNet
  20. Y. Liu, B. Li, J. Lu, and J. Cao, “Pinning control for the disturbance decoupling problem of Boolean networks,” IEEE Transactions on Automatic Control, vol. 62, no. 12, pp. 6595–6601, 2017. View at: Publisher Site | Google Scholar
  21. F. Li and Z. Yu, “Anti-synchronization of two coupled Boolean networks,” Journal of The Franklin Institute, vol. 353, no. 18, pp. 5013–5024, 2016. View at: Publisher Site | Google Scholar | MathSciNet
  22. Y. Liu, B. Li, H. Chen, and J. Cao, “Function perturbations on singular Boolean networks,” Automatica, vol. 84, pp. 36–42, 2017. View at: Publisher Site | Google Scholar | MathSciNet
  23. E. Fornasini and M. E. Valcher, “Optimal control of Boolean control networks,” Institute of Electrical and Electronics Engineers Transactions on Automatic Control, vol. 59, no. 5, pp. 1258–1270, 2014. View at: Publisher Site | Google Scholar | MathSciNet
  24. Y. Wu and T. Shen, “A finite convergence criterion for the discounted optimal control of stochastic logical networks,” IEEE Transactions on Automatic Control, vol. 63, no. 1, pp. 262–268, 2018. View at: Publisher Site | Google Scholar
  25. Q. Liu, Q. Zeng, J. Huang, and D. Li, “Optimal Intervention in Semi-Markov-Based Asynchronous Probabilistic Boolean Networks,” Complexity, vol. 2018, pp. 1–12, 2018. View at: Publisher Site | Google Scholar
  26. Q. Zhu, Y. Liu, J. Lu, and J. Cao, “On the optimal control of Boolean control networks,” SIAM Journal on Control and Optimization, vol. 56, no. 2, pp. 1321–1341, 2018. View at: Publisher Site | Google Scholar | MathSciNet
  27. Y. Liu, J. Cao, B. Li, and J. Lu, “Normalization and solvability of dynamic-algebraic Boolean networks,” IEEE Transactions on Neural Networks and Learning Systems, vol. 29, no. 7, pp. 3301–3306, 2018. View at: Google Scholar | MathSciNet
  28. P. Guo, H. Zhang, F. E. Alsaadi, and T. Hayat, “Semi-tensor product method to a class of event-triggered control for finite evolutionary networked games,” IET Control Theory & Applications, vol. 11, no. 13, pp. 2140–2145, 2017. View at: Publisher Site | Google Scholar | MathSciNet
  29. H. Li, X. Ding, A. Alsaedi, and F. E. Alsaadi, “Stochastic set stabilisation of n-person random evolutionary Boolean games and its applications,” IET Control Theory & Applications, vol. 11, no. 13, pp. 2152–2160, 2017. View at: Publisher Site | Google Scholar | MathSciNet
  30. B. Wang, J.-e. Feng, and M. Meng, “Matrix approach to model matching of composite asynchronous sequential machines,” IET Control Theory & Applications, vol. 11, no. 13, pp. 2122–2130, 2017. View at: Publisher Site | Google Scholar | MathSciNet
  31. J. Wang, X. Han, Z. Chen, and Q. Zhang, “Calculating skeleton matrix of asynchronous sequential machines based on the semi-tensor product of matrices,” IET Control Theory & Applications, vol. 11, no. 13, pp. 2131–2139, 2017. View at: Publisher Site | Google Scholar | MathSciNet
  32. Y. Sun, G. Feng, and J. Cao, “Robust stochastic stability analysis of genetic regulatory networks with disturbance attenuation,” Neurocomputing, vol. 79, pp. 39–49, 2012. View at: Publisher Site | Google Scholar
  33. H. Li, L. Xie, and Y. Wang, “On robust control invariance of Boolean control networks,” Automatica, vol. 68, pp. 392–396, 2016. View at: Publisher Site | Google Scholar
  34. S. V. Rakovic, E. C. Kerrigan, D. Q. Mayne, and K. I. Kouramas, “Optimized robust control invariance for linear discrete-time systems: theoretical foundations,” Automatica, vol. 43, no. 5, pp. 831–841, 2007. View at: Publisher Site | Google Scholar | MathSciNet
  35. H. Li and Y. Wang, “Output feedback stabilization control design for Boolean control networks,” Automatica, vol. 49, no. 12, pp. 3641–3645, 2013. View at: Publisher Site | Google Scholar | MathSciNet
  36. N. Bof, E. Fornasini, and M. E. Valcher, “Output feedback stabilization of Boolean control networks,” Automatica, vol. 57, pp. 21–28, 2015. View at: Publisher Site | Google Scholar | MathSciNet
  37. J. Zhong, D. W. Ho, J. Lu, and W. Xu, “Global robust stability and stabilization of Boolean network with disturbances,” Automatica, vol. 84, pp. 142–148, 2017. View at: Publisher Site | Google Scholar | MathSciNet
  38. H. Li, Y. Wang, and L. Xie, “Output tracking control of Boolean control networks via state feedback: Constant reference signal case,” Automatica, vol. 59, article 6422, pp. 54–59, 2015. View at: Publisher Site | Google Scholar
  39. F. Robert, Discrete iterations: a metric study, Springer Science & Business Media, 2012. View at: Publisher Site | MathSciNet
  40. L. Ljung and T. Söderström, Theory and Practice of Recursive Identification, MIT Press, Cambridge, MA, USA, 1983. View at: MathSciNet
  41. A. Veliz-Cuba and B. Stigler, “Boolean models can explain bistability in the lac operon,” Journal of Computational Biology, vol. 18, no. 6, pp. 783–794, 2011. View at: Publisher Site | Google Scholar | MathSciNet

Copyright © 2019 Bowen Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

321 Views | 255 Downloads | 13 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.