Displaying similar documents to “Reconstructibility of Boolean control networks with time delays in states”

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

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

On maximal QROBDD’s of boolean functions

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

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et 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).

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

WWW-based Boolean function minimization

Sebastian Tomaszewski, Ilgaz Celik, George Antoniou (2003)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the Quine-McCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up to four variables, at the URL http://www.csam.montclair.edu/~antoniou/bs. After extensive testing, the performance of the algorithm has been found to be excellent. The proposed application...

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