Displaying similar documents to “Finite-time observability of probabilistic Boolean multiplex control networks”

Some necessary and sufficient conditions for the output controllability of temporal Boolean control networks

Yang Liu, Jianquan Lu, Bo Wu (2014)

ESAIM: Control, Optimisation and Calculus of Variations

Similarity:

This paper investigates the output controllability problem of temporal Boolean networks with inputs (control nodes) and outputs (controlled nodes). A temporal Boolean network is a logical dynamic system describing cellular networks with time delays. Using semi-tensor product of matrices, the temporal Boolean networks can be converted into discrete time linear dynamic systems. Some necessary and sufficient conditions on the output controllability two kinds of inputs are obtained by providing...

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

On maximal QROBDD's of Boolean functions

Jean-Francis Michon, Jean-Baptiste Yunès, Pierre Valarcher (2010)

RAIRO - Theoretical Informatics and Applications

Similarity:

We investigate the structure of “worst-case” quasi reduced ordered decision diagrams and Boolean functions whose truth tables are associated to: we suggest different ways to count and enumerate them. We, then, introduce a notion of complexity which leads to the concept of “hard” Boolean functions as functions whose QROBDD are “worst-case” ones. So we exhibit the relation between hard functions and the Storage Access function (also known as Multiplexer).