Displaying similar documents to “Some necessary and sufficient conditions for the output controllability of temporal Boolean control networks”

Finite-time observability of probabilistic Boolean multiplex control networks

Yuxin Cui, Shu Li, Yunxiao Shan (2024)

Kybernetika

Similarity:

This paper investigates the finite-time observability of probabilistic Boolean multiplex control networks (PBMCNs). Firstly, the finite-time observability of the PBMCNs is converted into the set reachability issue according to the parallel interconnection technique (a minor modification of the weighted pair graph method in the literature). Secondly, the necessary and sufficient condition for the finite-time observability of PBMCNs is presented based on the set reachability. Finally,...

Reconstructibility of Boolean control networks with time delays in states

Ping Sun, Lijun Zhang, Kuize Zhang (2018)

Kybernetika

Similarity:

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

On Boolean modus ponens.

Sergiu Rudeanu (1998)

Mathware and Soft Computing

Similarity:

An abstract form of modus ponens in a Boolean algebra was suggested in [1]. In this paper we use the general theory of Boolean equations (see e.g. [2]) to obtain a further generalization. For a similar research on Boolean deduction theorems see [3].