Reconstructibility of Boolean control networks with time delays in states. (English) Zbl 1463.93122

Sun, Ping; Zhang, Lijun; Zhang, Kuize

Kybernetika 54, No. 5, 1091-1104 (2018).

Summary: 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.

MSC:

93C29	Boolean control/observation systems
93B70	Networked control
93C43	Delay control/observation systems
68Q45	Formal languages and automata

Keywords:

Boolean control network; reconstructibility; semi-tensor product of matrices; weighted pair graph; finite automaton; formal language