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
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
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
Cité par Sources :