Observability and Detectability of Large-Scale Boolean Control Networks
In Chaps. 4 and 5, we investigated how to verify different notions of observability and detectability for Boolean control networks (BCNs), and also studied how to determine the initial state (current state) of a BCN according to a particular notion of observability (detectability). In addition, we proved that the problems of verifying these notions are all NP-hard in the number of nodes. Hence, these problems are generally intractable. Actually, in general, for a BCN with more than 30 nodes, one cannot obtain whether it is observable or detectable in a reasonable amount of time by using a personal computer (PC). Hence BCNs with more than 30 nodes can be regarded as large-scale.
- Akutsu T et al (1998) A system for identifying genetic networks from gene expression patterns produced by gene disruptions and overexpressions. Genome Inform Work Genome Inform 9:151–160Google Scholar
- Klamt S et al (2006) A methodology for the structural and functional analysis of signaling and regulatory networks. BMC Bioinform 7(56):1–26Google Scholar
- Louati A, Aufaure MA, Lechevallier Y (2013) Graph aggregation: application to social networks. In: Guan R et al (eds) Advances in theory and applications of high dimensional and symbolic data analysis, vol RNTI-E-25, Hermann, pp 157–177Google Scholar
- Veliz-Cuba A et al (2014) Steady state analysis of Boolean molecular network models via model reduction and computational algebra. BMC Bioinform 15(1):221Google Scholar
- Zhang K, Johansson KH (2018) Efficient observability verification for large-scale Boolean control networks. In: 2018 37th Chinese control conference (CCC), pp 560–567Google Scholar
- Zhao Q (2005) A remark on scalar equations for synchronous boolean networks with biological applications by CF arrow, J Heidel, J Maloney, J Rogers. IEEE Trans Neural Netw 16(6):1715–1716Google Scholar