Related Experiment Videos
Symbolic approach to verification and control of deterministic/probabilistic Boolean networks
1School of Information Science, Japan Advanced Institute of Science and Technology, Ishikawa 923-1292, Japan.
IET Systems Biology
|April 6, 2013
Summary
This study introduces a probabilistic Boolean network (BN) model for analyzing biological networks. The new method uses the PRISM model checker for easier analysis and control of gene regulatory and apoptosis networks.
Area of Science:
- Computational Biology
- Systems Biology
- Network Science
Background:
- Boolean networks (BNs) are established models for biological systems, particularly gene regulatory networks.
- Verification and control problems in BNs are crucial for understanding network dynamics.
- Existing methods may lack flexibility in handling synchronous and asynchronous dynamics.
Purpose of the Study:
- To develop a generalized probabilistic Boolean network (BN) model.
- To propose a novel method for verification and control problems in BNs.
- To provide a convenient tool for analyzing and controlling biological networks.
Main Methods:
- Derivation of a probabilistic model encompassing both synchronous and asynchronous Boolean dynamics.
- Generalization of the model into a probabilistic BN.
- Application of a probabilistic model checker, PRISM, for solving verification/control problems.
Main Results:
- A generalized probabilistic BN model was successfully derived.
- A PRISM-based solution method for BN verification/control problems was proposed.
- The method was effectively applied to apoptosis and WNT5A biological networks.
Conclusions:
- The proposed PRISM-based approach offers an accessible and efficient tool for the analysis and control of biological networks.
- This probabilistic BN model enhances the study of complex biological system dynamics.
- The findings facilitate a deeper understanding and manipulation of gene regulatory mechanisms.
Related Concept Videos
Relation between Mathematical Equations and Block Diagrams
In a spring-mass-damper system, the second-order differential equation describes the dynamic behavior of the system. When transformed into the Laplace domain under zero initial conditions, this equation can be effectively analyzed and manipulated. The transformation into the Laplace domain converts differential equations into algebraic equations, simplifying the process of isolating the output.
SFG Algebra
In Signal Flow Graph (SFG) algebra, the value a node represents is determined by the sum of all signals entering that node. This summed value is then transmitted through every branch leaving the node, making the SFG a powerful tool for visualizing and analyzing control systems.
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...
Block Diagram Reduction
The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Signal Flow Graphs
Signal-flow graphs offer a streamlined and intuitive approach to representing control systems, providing an alternative to traditional block diagrams. These graphs use branches to symbolize systems and nodes to represent signals, effectively illustrating the relationships and interactions within the system.
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...
In a signal-flow graph, branches denote the system's transfer functions, while nodes represent the signals. The direction of signal flow is indicated by arrows, with the corresponding...
Constraints and Statical Determinacy
In structural engineering, the equilibrium of a system is not only determined by its equations of equilibrium but also with the help of constraints. Constraints refer to restrictions on the motion of a system. The proper combinations of constraints can minimize the total number of constraints needed to maintain a system in mechanical equilibrium. When this happens, the system is said to be statically determinate. For such systems, the unknown reaction supports can be estimated using equilibrium...
BIBO stability of continuous and discrete -time systems
System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
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.
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.