Reconstructibility of Boolean control networks with time delays in states

Ping Sun; Lijun Zhang; Kuize Zhang

Kybernetika (2018)

  • Volume: 54, Issue: 5, page 1091-1104
  • ISSN: 0023-5954

Abstract

top
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.

How to cite

top

Sun, Ping, Zhang, Lijun, and Zhang, Kuize. "Reconstructibility of Boolean control networks with time delays in states." Kybernetika 54.5 (2018): 1091-1104. <http://eudml.org/doc/294552>.

@article{Sun2018,
abstract = {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.},
author = {Sun, Ping, Zhang, Lijun, Zhang, Kuize},
journal = {Kybernetika},
keywords = {Boolean control network; reconstructibility; semi-tensor product of matrices; weighted pair graph; finite automaton; formal language},
language = {eng},
number = {5},
pages = {1091-1104},
publisher = {Institute of Information Theory and Automation AS CR},
title = {Reconstructibility of Boolean control networks with time delays in states},
url = {http://eudml.org/doc/294552},
volume = {54},
year = {2018},
}

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
PB - Institute of Information Theory and Automation AS CR
VL - 54
IS - 5
SP - 1091
EP - 1104
AB - 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.
LA - eng
KW - Boolean control network; reconstructibility; semi-tensor product of matrices; weighted pair graph; finite automaton; formal language
UR - http://eudml.org/doc/294552
ER -

References

top
  1. Akutsu, T., Hayashida, M., Ching, W., Ng, M. K., 10.1016/j.jtbi.2006.09.023, J. Theoret. Biology 244 (2007), 670-679. MR2306355DOI10.1016/j.jtbi.2006.09.023
  2. Bolotin, A., 10.1007/s10701-016-0018-7, Foundat. Physics 46 (2016), 1-16. MR3544893DOI10.1007/s10701-016-0018-7
  3. Cheng, D., 10.1007/s10255-003-0097-z, Acta Math. Appl. Sinica 19 (2003), 219-228. MR2011484DOI10.1007/s10255-003-0097-z
  4. Cheng, D., 10.1109/tnn.2008.2011359, IEEE Trans. Neural Networks. 20 (2009), 512-521. DOI10.1109/tnn.2008.2011359
  5. Cheng, D., Qi, H., 10.1109/tac.2010.2043294, IEEE Trans. Automat. Control 55 (2010), 2251-2258. MR2742217DOI10.1109/tac.2010.2043294
  6. Cheng, D., Qi, H., Li, Z., 10.1016/j.automatica.2009.10.036, Automatica 46 (2010), 62-69. MR2777196DOI10.1016/j.automatica.2009.10.036
  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. MR2761796
  9. al., C. Farrow et, 10.1109/tnn.2004.824262, IEEE Trans. Neural Networks 15 (2004), 348-354. DOI10.1109/tnn.2004.824262
  10. Fornasini, E., Valcher, M. E., 10.1109/tac.2012.2231592, IEEE Trans. Automat. Control 58 (2013), 1390-1401. MR3065124DOI10.1109/tac.2012.2231592
  11. Fornasini, E., Valcher, M. E., 10.1109/tac.2015.2396646, IEEE Trans. Automat. Control 60 (2015), 2734-2739. MR3405989DOI10.1109/tac.2015.2396646
  12. Haitao, L. I., Zhao, G., Meng, M., Feng, J., 10.1007/s11432-017-9238-1, Science China (Inform. Sci.) 61 (2018), 1, 010202. MR3737404DOI10.1007/s11432-017-9238-1
  13. Han, M., Liu, Y., Tu, Y., 10.1016/j.neucom.2013.09.012, Neurocomputing 129 (2014), 467-475. DOI10.1016/j.neucom.2013.09.012
  14. Ideker, T., Galitski, T., Hood, L., 10.1146/annurev.genom.2.1.343, Ann. Rev. Genomics Hum. Genet. 2 (2001), 343-372. DOI10.1146/annurev.genom.2.1.343
  15. Kari, J., A Lecture Note on Automata and Formal Languages., http://users.utu.fi/jkari/automata/, 2016. 
  16. Kauffman, S. A., 10.1016/0022-5193(69)90015-0, J. Theoret. Biology 22 (1969), 437-467. MR2436652DOI10.1016/0022-5193(69)90015-0
  17. Khalil, H. K., Nonlinear Systems., MacMillan, New York 1992. Zbl1194.93083MR1201326
  18. Li, F., Sun, J., Wu, Q., 10.1109/tnn.2011.2126594, IEEE Trans. Neural Networks 22 (2011), 948-954. DOI10.1109/tnn.2011.2126594
  19. Li, F., Sun, J., Wu, Q., 10.1109/tnn.2011.2126594, IEEE Trans. Neural Networks 22 (2011), 948-954. DOI10.1109/tnn.2011.2126594
  20. Lu, J., Li, H., Liu, Y., Li, F., 10.1049/iet-cta.2016.1659, IET Control Theory Appl. 11 (2017) 13, 2040-2047. MR3727046DOI10.1049/iet-cta.2016.1659
  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., 10.1016/j.ipl.2004.10.009, Inform. Process. Lett. 93 (2005), 163-168. MR2110605DOI10.1016/j.ipl.2004.10.009
  23. Valmari, A., 10.1007/s00236-015-0217-2, Acta Inform. 52 (2015), 207-234. MR3323586DOI10.1007/s00236-015-0217-2
  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. MR3545104
  25. Zhang, L., Zhang, K., 10.1109/tnnls.2013.2246187, IEEE Trans. Neural Networks Learning Syst. 24 (2013), 1478-1484. MR3110659DOI10.1109/tnnls.2013.2246187
  26. Zhang, L., Zhang, K., 10.1007/s11432-012-4651-2, Science China (Inform. Sci.) 56 (2013), 1-12. MR3110659DOI10.1007/s11432-012-4651-2
  27. Zhang, K., Zhang, L., 10.1007/s11432-012-4651-2, Science China (Inform. Sci.) 59 (2016), 092204:1-092204:10. MR3544105DOI10.1007/s11432-012-4651-2
  28. Zhang, K., Zhang, L., Su, R., 10.1137/140991285, SIAM J. Control Optim. 54 (2016), 3040-3060. MR3573305DOI10.1137/140991285
  29. Zhao, Y., Qi, H., Cheng, D., 10.1016/j.sysconle.2010.09.002, Systems Control Lett. 59 (2010), 767-774. MR2779787DOI10.1016/j.sysconle.2010.09.002

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.