{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T06:16:57Z","timestamp":1773987417539,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:00:00Z","timestamp":1648684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:00:00Z","timestamp":1648684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s11432-021-3365-2","type":"journal-article","created":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T04:09:28Z","timestamp":1649131768000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":49,"title":["Minimal observability of Boolean networks"],"prefix":"10.1007","volume":"65","author":[{"given":"Yang","family":"Liu","sequence":"first","affiliation":[]},{"given":"Jie","family":"Zhong","sequence":"additional","affiliation":[]},{"given":"Daniel W. C.","family":"Ho","sequence":"additional","affiliation":[]},{"given":"Weihua","family":"Gui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,31]]},"reference":[{"key":"3365_CR1","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0022-5193(69)90015-0","volume":"22","author":"S A Kauffman","year":"1969","unstructured":"Kauffman S A. Metabolic stability and epigenesis in randomly constructed genetic nets. J Theor Biol, 1969, 22: 437\u2013467","journal-title":"J Theor Biol"},{"key":"3365_CR2","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1126\/science.1069883","volume":"295","author":"E H Davidson","year":"2002","unstructured":"Davidson E H, Rast J P, Oliveri P, et al. A genomic regulatory network for development. Science, 2002, 295: 1669\u20131678","journal-title":"Science"},{"key":"3365_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/bulm.1999.0155","volume":"62","author":"P Smolen","year":"2000","unstructured":"Smolen P, Baxter D A, Byrne J H. Modeling transcriptional control in gene networks\u2014methods, recent results, and future directions. Bull Math Biol, 2000, 62: 247\u2013292","journal-title":"Bull Math Biol"},{"key":"3365_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1089\/cmb.2018.0095","volume":"26","author":"C Barrett","year":"2019","unstructured":"Barrett C, He Q, Huang F W, et al. A Boltzmann sampler for 1-pairs with double filtration. J Comput Biol, 2019, 26: 173\u2013192","journal-title":"J Comput Biol"},{"key":"3365_CR5","doi-asserted-by":"publisher","first-page":"2181","DOI":"10.1137\/19M1243890","volume":"18","author":"R X F Chen","year":"2019","unstructured":"Chen R X F, Bura A C, Reidys C M. D-chain tomography of networks: a new structure spectrum and an application to the SIR process. SIAM J Appl Dyn Syst, 2019, 18: 2181\u20132201","journal-title":"SIAM J Appl Dyn Syst"},{"key":"3365_CR6","volume-title":"Analysis and Control of Boolean Networks: a Semi-Tensor Product Approach","author":"D Cheng","year":"2010","unstructured":"Cheng D, Qi H, Li Z. Analysis and Control of Boolean Networks: a Semi-Tensor Product Approach. New York: Springer, 2010"},{"key":"3365_CR7","doi-asserted-by":"publisher","first-page":"2251","DOI":"10.1109\/TAC.2010.2043294","volume":"55","author":"D Cheng","year":"2010","unstructured":"Cheng D, Qi H. A linear representation of dynamics of Boolean networks. IEEE Trans Automat Contr, 2010, 55: 2251\u20132258","journal-title":"IEEE Trans Automat Contr"},{"key":"3365_CR8","doi-asserted-by":"publisher","first-page":"2525","DOI":"10.1016\/j.automatica.2013.05.004","volume":"49","author":"G Hochma","year":"2013","unstructured":"Hochma G, Margaliot M, Fornasini E, et al. Symbolic dynamics of Boolean control networks. Automatica, 2013, 49: 2525\u20132530","journal-title":"Automatica"},{"key":"3365_CR9","doi-asserted-by":"publisher","first-page":"2351","DOI":"10.1016\/j.automatica.2013.04.038","volume":"49","author":"D Laschov","year":"2013","unstructured":"Laschov D, Margaliot M, Even G. Observability of Boolean networks: a graph-theoretic approach. Automatica, 2013, 49: 2351\u20132362","journal-title":"Automatica"},{"key":"3365_CR10","doi-asserted-by":"publisher","first-page":"1390","DOI":"10.1109\/TAC.2012.2231592","volume":"58","author":"E Fornasini","year":"2013","unstructured":"Fornasini E, Valcher M E. Observability, reconstructibility and state observers of Boolean control networks. IEEE Trans Automat Contr, 2013, 58: 1390\u20131401","journal-title":"IEEE Trans Automat Contr"},{"key":"3365_CR11","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1109\/TAC.2019.2917748","volume":"65","author":"Z Zhang","year":"2020","unstructured":"Zhang Z, Leifeld T, Zhang P. Reduced-order observer design for Boolean control networks. IEEE Trans Automat Contr, 2020, 65: 434\u2013441","journal-title":"IEEE Trans Automat Contr"},{"key":"3365_CR12","doi-asserted-by":"publisher","first-page":"108621","DOI":"10.1016\/j.automatica.2019.108621","volume":"111","author":"Y Yu","year":"2020","unstructured":"Yu Y, Meng M, Feng J. Observability of Boolean networks via matrix equations. Automatica, 2020, 111: 108621","journal-title":"Automatica"},{"key":"3365_CR13","doi-asserted-by":"publisher","first-page":"6402","DOI":"10.1109\/TNNLS.2018.2826075","volume":"29","author":"Y Guo","year":"2018","unstructured":"Guo Y. Observability of Boolean control networks using parallel extension and set reachability. IEEE Trans Neural Netw Learn Syst, 2018, 29: 6402\u20136408","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"3365_CR14","doi-asserted-by":"publisher","first-page":"092201","DOI":"10.1007\/s11432-017-9135-4","volume":"61","author":"Q X Zhu","year":"2018","unstructured":"Zhu Q X, Liu Y, Lu J Q, et al. Observability of Boolean control networks. Sci China Inf Sci, 2018, 61: 092201","journal-title":"Sci China Inf Sci"},{"key":"3365_CR15","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.sysconle.2018.03.004","volume":"115","author":"D Cheng","year":"2018","unstructured":"Cheng D, Li C, He F. Observability of Boolean networks via set controllability approach. Syst Control Lett, 2018, 115: 22\u201325","journal-title":"Syst Control Lett"},{"key":"3365_CR16","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.sysconle.2015.11.004","volume":"87","author":"D Cheng","year":"2016","unstructured":"Cheng D, Qi H, Liu T, et al. A note on observability of Boolean control networks. Syst Control Lett, 2016, 87: 76\u201382","journal-title":"Syst Control Lett"},{"key":"3365_CR17","doi-asserted-by":"publisher","first-page":"2733","DOI":"10.1109\/TAC.2015.2501365","volume":"61","author":"K Zhang","year":"2016","unstructured":"Zhang K, Zhang L. Observability of Boolean control networks: a unified approach based on finite automata. IEEE Trans Automat Contr, 2016, 61: 2733\u20132738","journal-title":"IEEE Trans Automat Contr"},{"key":"3365_CR18","doi-asserted-by":"publisher","unstructured":"Lin L, Cao J, Lu J, et al. Stabilizing large-scale probabilistic Boolean networks by pinning control. IEEE Trans Cybern, 2021. doi: https:\/\/doi.org\/10.1109\/TCYB.2021.3092374","DOI":"10.1109\/TCYB.2021.3092374"},{"key":"3365_CR19","doi-asserted-by":"publisher","first-page":"948","DOI":"10.1109\/TNN.2011.2126594","volume":"22","author":"F F Li","year":"2011","unstructured":"Li F F, Sun J T, Wu Q-D. Observability of Boolean control networks with state time delays. IEEE Trans Neural Netw, 2011, 22: 948\u2013954","journal-title":"IEEE Trans Neural Netw"},{"key":"3365_CR20","doi-asserted-by":"publisher","first-page":"1550","DOI":"10.1109\/TAC.2021.3070307","volume":"67","author":"J Zhong","year":"2022","unstructured":"Zhong J, Liu Y, Lu J, et al. Pinning control for stabilization of Boolean networks under knock-out perturbation. IEEE Trans Automat Contr, 2022, 67: 1550\u20131557","journal-title":"IEEE Trans Automat Contr"},{"key":"3365_CR21","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1137\/140991820","volume":"54","author":"J Lu","year":"2016","unstructured":"Lu J, Zhong J, Ho D W C, et al. On controllability of delayed Boolean control networks. SIAM J Control Optim, 2016, 54: 475\u2013494","journal-title":"SIAM J Control Optim"},{"key":"3365_CR22","doi-asserted-by":"publisher","first-page":"2869","DOI":"10.1137\/110844660","volume":"51","author":"D Laschov","year":"2013","unstructured":"Laschov D, Margaliot M. Minimum-time control of Boolean networks. SIAM J Control Optim, 2013, 51: 2869\u20132892","journal-title":"SIAM J Control Optim"},{"key":"3365_CR23","doi-asserted-by":"publisher","first-page":"3040","DOI":"10.1137\/140991285","volume":"54","author":"K Zhang","year":"2016","unstructured":"Zhang K, Zhang L, Su R. A weighted pair graph representation for reconstructibility of Boolean control networks. SIAM J Control Optim, 2016, 54: 3040\u20133060","journal-title":"SIAM J Control Optim"},{"key":"3365_CR24","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.automatica.2016.12.007","volume":"78","author":"F Li","year":"2017","unstructured":"Li F, Tang Y. Set stabilization for switched Boolean control networks. Automatica, 2017, 78: 223\u2013230","journal-title":"Automatica"},{"key":"3365_CR25","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1016\/j.automatica.2018.06.030","volume":"95","author":"Y Li","year":"2018","unstructured":"Li Y, Li H, Sun W. Event-triggered control for robust set stabilization of logical control networks. Automatica, 2018, 95: 556\u2013560","journal-title":"Automatica"},{"key":"3365_CR26","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1137\/18M1170443","volume":"57","author":"H Li","year":"2019","unstructured":"Li H, Ding X. A control Lyapunov function approach to feedback stabilization of logical control networks. SIAM J Control Optim, 2019, 57: 810\u2013831","journal-title":"SIAM J Control Optim"},{"key":"3365_CR27","doi-asserted-by":"publisher","unstructured":"Zhong J, Yu Z, Li Y, et al. State estimation for probabilistic Boolean networks via outputs observation. IEEE Trans Neural Netw Learn Syst, 2021. doi: https:\/\/doi.org\/10.1109\/TNNLS.2021.3059795","DOI":"10.1109\/TNNLS.2021.3059795"},{"key":"3365_CR28","doi-asserted-by":"publisher","first-page":"1558","DOI":"10.1109\/TAC.2021.3069739","volume":"67","author":"S Zhu","year":"2022","unstructured":"Zhu S, Lu J, Lin L, et al. Minimum-time and minimum-triggering control for the observability of stochastic Boolean networks. IEEE Trans Automat Contr, 2022, 67: 1558\u20131565","journal-title":"IEEE Trans Automat Contr"},{"key":"3365_CR29","doi-asserted-by":"publisher","first-page":"2734","DOI":"10.1109\/TAC.2015.2396646","volume":"60","author":"E Fornasini","year":"2015","unstructured":"Fornasini E, Valcher M E. Fault detection analysis of Boolean control networks. IEEE Trans Automat Contr, 2015, 60: 2734\u20132739","journal-title":"IEEE Trans Automat Contr"},{"key":"3365_CR30","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1109\/TAC.2013.2238092","volume":"58","author":"R Li","year":"2013","unstructured":"Li R, Yang M, Chu T. State feedback stabilization for Boolean control networks. IEEE Trans Automat Contr, 2013, 58: 1853\u20131857","journal-title":"IEEE Trans Automat Contr"},{"key":"3365_CR31","doi-asserted-by":"publisher","first-page":"1658","DOI":"10.1109\/TAC.2015.2478123","volume":"61","author":"J Lu","year":"2016","unstructured":"Lu J, Zhong J, Huang C, et al. On pinning controllability of Boolean control networks. IEEE Trans Automat Contr, 2016, 61: 1658\u20131663","journal-title":"IEEE Trans Automat Contr"},{"key":"3365_CR32","doi-asserted-by":"publisher","unstructured":"Zhong J, Ho D W C, Lu J. A new approach to pinning control of Boolean networks. IEEE Trans Control Netw Syst, 2021. doi: https:\/\/doi.org\/10.1109\/TCNS.2021.3106453","DOI":"10.1109\/TCNS.2021.3106453"},{"key":"3365_CR33","doi-asserted-by":"publisher","first-page":"169201","DOI":"10.1007\/s11432-018-9575-4","volume":"63","author":"Y Liu","year":"2020","unstructured":"Liu Y, Cao J D, Wang L Q, et al. On pinning reachability of probabilistic Boolean control networks. Sci China Inf Sci, 2020, 63: 169201","journal-title":"Sci China Inf Sci"},{"key":"3365_CR34","doi-asserted-by":"publisher","first-page":"152207","DOI":"10.1007\/s11432-020-2981-4","volume":"64","author":"J Q Lu","year":"2021","unstructured":"Lu J Q, Li B W, Zhong J. A novel synthesis method for reliable feedback shift registers via Boolean networks. Sci China Inf Sci, 2021, 64: 152207","journal-title":"Sci China Inf Sci"},{"key":"3365_CR35","doi-asserted-by":"publisher","first-page":"212206","DOI":"10.1007\/s11432-019-2813-7","volume":"63","author":"B W Li","year":"2020","unstructured":"Li B W, Lu J Q. Boolean-network-based approach for construction of filter generators. Sci China Inf Sci, 2020, 63: 212206","journal-title":"Sci China Inf Sci"},{"key":"3365_CR36","unstructured":"Biswas D, Genest B. Minimal observability for transactional hierarchical services. In: Proceedings of International Conference on Software Engineering & Knowledge Engineering, 2018. 531\u2013536"},{"key":"3365_CR37","doi-asserted-by":"crossref","unstructured":"Sarma S, Dutt N. Minimal sparse observability of complex networks: application to MPSoC sensor placement and run-time thermal estimation & tracking. In: Proceedings of Conference on Design, Automation & Test in Europe, 2014. 329","DOI":"10.7873\/DATE2014.342"},{"key":"3365_CR38","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1109\/TCNS.2017.2746345","volume":"5","author":"Z Gao","year":"2018","unstructured":"Gao Z, Chen X, Basar T. Controllability of conjunctive Boolean networks with application to gene regulation. IEEE Trans Control Netw Syst, 2018, 5: 770\u2013781","journal-title":"IEEE Trans Control Netw Syst"},{"key":"3365_CR39","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.automatica.2017.11.017","volume":"89","author":"Z Gao","year":"2018","unstructured":"Gao Z, Chen X, Ba\u015far T. Stability structures of conjunctive Boolean networks. Automatica, 2018, 89: 8\u201320","journal-title":"Automatica"},{"key":"3365_CR40","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.automatica.2018.02.014","volume":"92","author":"E Weiss","year":"2018","unstructured":"Weiss E, Margaliot M, Even G. Minimal controllability of conjunctive Boolean networks is NP-complete. Automatica, 2018, 92: 56\u201362","journal-title":"Automatica"},{"key":"3365_CR41","doi-asserted-by":"publisher","first-page":"2727","DOI":"10.1109\/TAC.2018.2882154","volume":"64","author":"E Weiss","year":"2019","unstructured":"Weiss E, Margaliot M. A polynomial-time algorithm for solving the minimal observability problem in conjunctive Boolean networks. IEEE Trans Automat Contr, 2019, 64: 2727\u20132736","journal-title":"IEEE Trans Automat Contr"},{"key":"3365_CR42","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1109\/LCSYS.2018.2872295","volume":"3","author":"E Weiss","year":"2019","unstructured":"Weiss E, Margaliot M. Output selection and observer design for Boolean control networks: a sub-optimal polynomial-complexity algorithm. IEEE Control Syst Lett, 2019, 3: 210\u2013215","journal-title":"IEEE Control Syst Lett"},{"key":"3365_CR43","doi-asserted-by":"crossref","unstructured":"Liu R, Qian C, Jin Y. Observability and sensor allocation for Boolean networks. In: Proceedings of 2017 American Control Conference, 2017. 3880\u20133885","DOI":"10.23919\/ACC.2017.7963549"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3365-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-021-3365-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-021-3365-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T15:51:03Z","timestamp":1726933863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-021-3365-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,31]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["3365"],"URL":"https:\/\/doi.org\/10.1007\/s11432-021-3365-2","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,31]]},"assertion":[{"value":"7 May 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 October 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"152203"}}