Reconstructibility of Boolean control networks with time delays in states

Title:

Reconstructibility of Boolean control networks with time delays in states

Creator:

Sun, Ping, Zhang, Lijun, and Zhang, Kuize

Identifier:

https://cdk.lib.cas.cz/client/handle/uuid:148007ba-b3b9-4655-9de9-823a097faae1
uuid:148007ba-b3b9-4655-9de9-823a097faae1
doi:10.14736/kyb-2018-5-1091

Subject:

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

Type:

model:article and TEXT

Format:

bez média and svazek

Description:

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.

Language:

English

Rights:

http://creativecommons.org/publicdomain/mark/1.0/
policy:public

Source:

Kybernetika | 2018 Volume:54 | Number:5

Harvested from:

CDK

Metadata only:

false