Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

420
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
420
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

407
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
407
Block Diagram Reduction01:22

Block Diagram Reduction

671
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...
671
Constraints and Statical Determinacy01:26

Constraints and Statical Determinacy

1.1K
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...
1.1K
Woodward–Hoffmann Selection Rules and Microscopic Reversibility01:34

Woodward–Hoffmann Selection Rules and Microscopic Reversibility

4.2K
Electrocyclic reactions, cycloadditions, and sigmatropic rearrangements are concerted pericyclic reactions that proceed via a cyclic transition state. These reactions are stereospecific and regioselective. The stereochemistry of the products depends on the symmetry characteristics of the interacting orbitals and the reaction conditions. Accordingly, pericyclic reactions are classified as either symmetry-allowed or symmetry-forbidden. Woodward and Hoffmann presented the selection criteria for...
4.2K
Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

433
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
433

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Node and edge control strategy identification via trap spaces in Boolean networks.

BMC bioinformatics·2025
Same author

A three-node Turing gene circuit forms periodic spatial patterns in bacteria.

Cell systems·2024
Same author

Structure and behavior in Boolean monotonic model pools.

Bio Systems·2022
Same author

Modelling Oscillatory Patterns in the Bovine Estrous Cycle with Boolean Delay Equations.

Bulletin of mathematical biology·2021
Same author

The design principles of discrete turing patterning systems.

Journal of theoretical biology·2021
Same author

Boolean analysis of lateral inhibition.

Journal of mathematical biology·2020

Related Experiment Video

Updated: Apr 1, 2026

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

11.0K

Approximating Attractors of Boolean Networks by Iterative CTL Model Checking.

Hannes Klarner1, Heike Siebert1

  • 1Fachbereich Mathematik und Informatik, Freie Universität Berlin , Berlin , Germany.

Frontiers in Bioengineering and Biotechnology
|October 7, 2015
PubMed
Summary

This study approximates Boolean network attractors using minimal trap spaces. These spaces accurately capture the network's long-term behavior, offering a more efficient analysis method.

Keywords:
ASPBoolean networksCTL model checkingasynchronous dynamicsattractorsgene regulationsignaling

Related Experiment Videos

Last Updated: Apr 1, 2026

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks
11:18

Closed-loop Neuro-robotic Experiments to Test Computational Properties of Neuronal Networks

Published on: March 2, 2015

11.0K

Area of Science:

  • Computational Biology
  • Systems Biology
  • Network Science

Background:

  • Boolean networks are widely used to model biological systems.
  • Analyzing the long-term behavior (asynchronous attractors) of these networks is computationally challenging.
  • Existing methods for attractor approximation can be inefficient or lack precision.

Purpose of the Study:

  • To introduce minimal trap spaces as a method for approximating asynchronous attractors in Boolean networks.
  • To define and evaluate criteria (faithfulness, univocality, completeness) for assessing the quality of these approximations.
  • To develop an efficient algorithm for finding these minimal trap spaces.

Main Methods:

  • Defining approximation quality criteria: faithfulness, univocality, and completeness.
  • Formulating model checking queries for these criteria.
  • Developing an iterative refinement algorithm using autonomous sets to reduce state space complexity for model checking.
  • Benchmarking the algorithm on 18 published Boolean networks.

Main Results:

  • Faithfulness, univocality, and completeness can be formulated as reachability properties.
  • An efficient algorithm based on iterative refinement and autonomous sets was developed.
  • Model checking on reduced state spaces is feasible.
  • All minimal trap spaces in the benchmark networks were found to be faithful, univocal, and complete.

Conclusions:

  • Minimal trap spaces provide a robust and efficient approximation for Boolean network attractors.
  • The proposed algorithm effectively identifies these minimal trap spaces.
  • This approach enhances the analysis of complex biological systems modeled by Boolean networks.