Related papers: A SAT-Based Algorithm for Computing Attractors in …
We present a constructive SAT-based algorithm to determine the multiplicative complexity of a Boolean function, i.e., the smallest number of AND gates in any logic network that consists of 2-input AND gates, 2-input XOR gates, and…
Effective control of biological systems can often be achieved through the control of a surprisingly small number of distinct variables. We bring clarity to such results using the formalism of Boolean dynamical networks, analyzing the…
A Boolean network is a finite dynamical system, whose variables take values from a binary set. The value update rule for each variable is a Boolean function, depending on a selected subset of variables. Boolean networks have been widely…
Cellular phenotypes are determined by the dynamical activity of networks of co-regulated genes. Elucidating such networks is crucial for the understanding of normal cell physiology as well as for the dissection of complex pathologic…
We consider transformations between attractor basins of binary cylindrical cellular automata resulting from mutations. A t-point mutation of a state consists in toggling t sites in that state. Results of such mutations are described by a…
Observing the internal state of the whole system using a small number of sensor nodes is important in analysis of complex networks. Here, we study the problem of determining the minimum number of sensor nodes to discriminate attractors…
Boolean automata networks (aka Boolean networks) are space-time discrete dynamical systems, studied as a model of computation and as a representative model of natural phenomena. A collection of simple entities (the automata) update their…
Many biological systems, such as metabolic pathways, exhibit bistability behavior: these biological systems exhibit two distinct stable states with switching between the two stable states controlled by certain conditions. Since…
Boolean satisfiability (SAT) problems are routinely solved by SAT solvers in real-life applications, yet solving time can vary drastically between solvers for the same instance. This has motivated research into machine learning models that…
We consider networks of delay-coupled Stuart-Landau oscillators. In these systems, the coupling phase has been found to be a crucial control parameter. By proper choice of this parameter one can switch between different synchronous…
We show that there is a randomized algorithm that, when given a small constant-depth Boolean circuit $C$ made up of gates that compute constant-degree Polynomial Threshold functions or PTFs (i.e., Boolean functions that compute signs of…
The evaluation of the number of attractors in Kauffman networks by Samuelsson and Troein is generalized to critical networks with one input per node and to networks with two inputs per node and different probability distributions for update…
In this paper we study the problem of dynamically maintaining graph properties under batches of edge insertions and deletions in the massively parallel model of computation. In this setting, the graph is stored on a number of machines, each…
This paper considers the synthesis of distributed reactive control protocols for a Boolean network in a distributed manner. We start with a directed acyclic graph representing a network of Boolean subsystems and a global contract, given as…
We extend a recently introduced class of exactly solvable models for recurrent neural networks with competition between 1D nearest neighbour and infinite range information processing. We increase the potential for further frustration and…
The Boolean autonomous dynamical systems, also called regular autonomous asynchronous systems are systems whose 'vector field' is a function {\Phi}:{0,1}^{n}{\to}{0,1}^{n} and time is discrete or continuous. While the synchronous systems…
This paper is concerned with the reduction of a noisy synchronous Boolean network to a coarse-grained Markov chain with number of states being equal to the number of attractors of the original network.
Stability is an important characteristic of network models that has implications for other desirable aspects such as controllability. The stability of a Boolean network depends on various factors, such as the topology of its wiring diagram…
The mutations of a complex systemic disease like cancer can be modeled as stuck-at faults in the Boolean system paradigm. For a class of multiple faults, the fault identification is exceptionally significant under the incomplete access of…
We propose the use of Deterministic Generalized Asynchronous Random Boolean Networks [Gershenson, 2002] as models of contextual deterministic discrete dynamical systems. We show that changes in the context have drastic effects on the global…