Geodesic
Reconstructibility of Boolean control networks with time delays in states
Kybernetika, Tome 54 (2018) no. 5, pp. 1091-1104
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

This paper deals with the reconstructibility of Boolean control networks (BCNs) with time delays in states. First, a survey on the semi-tensor product, weighted pair graph, constructed forest and finite automata is given. Second, by using the weighted pair graph, constructed forest and finite automata, an algorithm is designed to judge whether a Boolean control network with time delays in states is reconstructable or not under a mild assumption. Third, an algorithm is proposed to determine the current state. Finally, an illustrative example is given to show the effectiveness of the proposed method.
This paper deals with the reconstructibility of Boolean control networks (BCNs) with time delays in states. First, a survey on the semi-tensor product, weighted pair graph, constructed forest and finite automata is given. Second, by using the weighted pair graph, constructed forest and finite automata, an algorithm is designed to judge whether a Boolean control network with time delays in states is reconstructable or not under a mild assumption. Third, an algorithm is proposed to determine the current state. Finally, an illustrative example is given to show the effectiveness of the proposed method.
DOI : 10.14736/kyb-2018-5-1091
Classification : 03D05, 05C22, 68Q45, 94C10
Keywords: Boolean control network; reconstructibility; semi-tensor product of matrices; weighted pair graph; finite automaton; formal language 
@article{10_14736_kyb_2018_5_1091,
     author = {Sun, Ping and Zhang, Lijun and Zhang, Kuize},
     title = {Reconstructibility of {Boolean} control networks with time delays in states},
     journal = {Kybernetika},
     pages = {1091--1104},
     year = {2018},
     volume = {54},
     number = {5},
     doi = {10.14736/kyb-2018-5-1091},
     mrnumber = {3893137},
     zbl = {07031761},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.14736/kyb-2018-5-1091/}
}
TY  - JOUR
AU  - Sun, Ping
AU  - Zhang, Lijun
AU  - Zhang, Kuize
TI  - Reconstructibility of Boolean control networks with time delays in states
JO  - Kybernetika
PY  - 2018
SP  - 1091
EP  - 1104
VL  - 54
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.14736/kyb-2018-5-1091/
DO  - 10.14736/kyb-2018-5-1091
LA  - en
ID  - 10_14736_kyb_2018_5_1091
ER  - 
%0 Journal Article
%A Sun, Ping
%A Zhang, Lijun
%A Zhang, Kuize
%T Reconstructibility of Boolean control networks with time delays in states
%J Kybernetika
%D 2018
%P 1091-1104
%V 54
%N 5
%U http://geodesic.mathdoc.fr/articles/10.14736/kyb-2018-5-1091/
%R 10.14736/kyb-2018-5-1091
%G en
%F 10_14736_kyb_2018_5_1091
Sun, Ping; Zhang, Lijun; Zhang, Kuize. Reconstructibility of Boolean control networks with time delays in states. Kybernetika, Tome 54 (2018) no. 5, pp. 1091-1104. doi: 10.14736/kyb-2018-5-1091

[1] Akutsu, T., Hayashida, M., Ching, W., Ng, M. K.: Control of Boolean networks: Hardness results and algorithms for tree structured networks. J. Theoret. Biology 244 (2007), 670-679. | DOI | MR

[2] Bolotin, A.: Constructibility of the universal wave function. Foundat. Physics 46 (2016), 1-16. | DOI | MR

[3] Cheng, D.: On semi-tensor product of matrices and its applications. Acta Math. Appl. Sinica 19 (2003), 219-228. | DOI | MR

[4] Cheng, D.: Input-state approach to Boolean networks. IEEE Trans. Neural Networks. 20 (2009), 512-521. | DOI

[5] Cheng, D., Qi, H.: A linear representation of dynamics of Boolean networks. IEEE Trans. Automat. Control 55 (2010), 2251-2258. | DOI | MR

[6] Cheng, D., Qi, H., Li, Z.: Realization of Boolean control networks. Automatica 46 (2010), 62-69. | DOI | MR

[7] Cheng, D., Qi, H., Li, Z.: Controllability and Observability of Boolean Control Networks. Springer-Verlag, London 2011.

[8] Cheng, D., Qi, H., Li, Z.: Analysis and Control of Boolean Networks. Springer-Verlag, London 2011. | MR

[9] al., C. Farrow et: Scalar equations for synchronous Boolean networks with biological applications. IEEE Trans. Neural Networks 15 (2004), 348-354. | DOI

[10] Fornasini, E., Valcher, M. E.: Observability, reconstructibility and state observers of Boolean control networks. IEEE Trans. Automat. Control 58 (2013), 1390-1401. | DOI | MR

[11] Fornasini, E., Valcher, M. E.: Fault detection analysis of Boolean control networks. IEEE Trans. Automat. Control 60 (2015), 2734-2739. | DOI | MR

[12] Haitao, L. I., Zhao, G., Meng, M., Feng, J.: A survey on applications of semi-tensor product method in engineering. Science China (Inform. Sci.) 61 (2018), 1, 010202. | DOI | MR

[13] Han, M., Liu, Y., Tu, Y.: Controllability of Boolean control networks with time delays both in states and inputs. Neurocomputing 129 (2014), 467-475. | DOI

[14] Ideker, T., Galitski, T., Hood, L.: A new approach to decoding life: systems biology. Ann. Rev. Genomics Hum. Genet. 2 (2001), 343-372. | DOI

[15] Kari, J.: A Lecture Note on Automata and Formal Languages. http://users.utu.fi/jkari/automata/, 2016.

[16] Kauffman, S. A.: Metabolic stability and epigenesis in randomly constructed genetic nets. J. Theoret. Biology 22 (1969), 437-467. | DOI | MR

[17] Khalil, H. K.: Nonlinear Systems. MacMillan, New York 1992. | MR | Zbl

[18] Li, F., Sun, J., Wu, Q.: Observability of Boolean control networks with state time delays. IEEE Trans. Neural Networks 22 (2011), 948-954. | DOI

[19] Li, F., Sun, J., Wu, Q.: Observability of Boolean control networks with state time delays. IEEE Trans. Neural Networks 22 (2011), 948-954. | DOI

[20] Lu, J., Li, H., Liu, Y., Li, F.: Survey on semi-tensor product method with its applications in logical networks and other finite-valued systems. IET Control Theory Appl. 11 (2017) 13, 2040-2047. | DOI | MR

[21] Sui, H.: Regulation of Cellular states in mammalian cells from a genomewide view. In: Gene Regulations and Metabolism - Postgenomic Computational Approaches (J. Collado-Vides, ed.), MIT Press, MA 2002, pp. 181-220.

[22] Thomasian, A.: Reconstruct versus read-modify writes in RAID. Inform. Process. Lett. 93 (2005), 163-168. | DOI | MR

[23] Valmari, A.: On constructibility and unconstructibility of LTS operators from other LTS operators. Acta Inform. 52 (2015), 207-234. | DOI | MR

[24] Zhang, K., Zhang, L.: Observability of Boolean control networks: a unified approach based on the theories of finite automata. IEEE Trans. Automat. Control 61 (2015), 6854-6861. | MR

[25] Zhang, L., Zhang, K.: Controllability and observability of Boolean control networks with time-variant delays in states. IEEE Trans. Neural Networks Learning Syst. 24 (2013), 1478-1484. | DOI | MR

[26] Zhang, L., Zhang, K.: Controllability of time-variant Boolean control networks and its application to Boolean control networks with finite memories. Science China (Inform. Sci.) 56 (2013), 1-12. | DOI | MR

[27] Zhang, K., Zhang, L.: Controllability of probabilistic Boolean control networks with time-variant delays in states. Science China (Inform. Sci.) 59 (2016), 092204:1-092204:10. | DOI | MR

[28] Zhang, K., Zhang, L., Su, R.: A weighted pair graph representation for reconstructibility of Boolean control networks. SIAM J. Control Optim. 54 (2016), 3040-3060. | DOI | MR

[29] Zhao, Y., Qi, H., Cheng, D.: Input-state incidence matrix of Boolean control networks and its applications. Systems Control Lett. 59 (2010), 767-774. | DOI | MR

Cité par Sources :