On Attractor Detection and Optimal Control of Deterministic Generalized Asynchronous Random Boolean Networks
Abstract:
Deterministic asynchronous Boolean networks play a crucial role in modeling and analysis of gene regulatory networks. In this paper, we focus on a typical type of deterministic asynchronous Boolean networks called deterministic generalized asynchronous random Boolean networks (DGARBNs). We first formulate the extended state transition graph, which captures the whole dynamics of a DGARBN and paves potential ways to analyze this DGARBN. We then propose two SMT-based methods for attractor detection and optimal control of DGARBNs. These methods are implemented in a JAVA tool called DABoolNet. Two experiments are designed to highlight the scalability of the proposed methods. We also formally state and prove several relations between DGARBNs and other models including deterministic asynchronous models, block-sequential Boolean networks, generalized asynchronous random Boolean networks, and mixed-context random Boolean networks. Several case studies are presented to show the applications of our methods.
Related Concept Videos
Multimachine Stability
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
Sequence Networks of Rotating Machines
Zero-sequence current induces a voltage drop across the generator's neutral impedance and other...
Simplified Synchronous Machine Model
In this model, each generator is connected to a...
Network Function of a Circuit
BIBO stability of continuous and discrete -time systems
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
Linear time-invariant Systems
The input-output behavior of an LTI system can be fully defined by its response to an impulsive excitation at its input. Once this impulse response is known, the system's reaction to any other input can be...

