Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

State Space Representation

State Space Representation

The frequency-domain technique, commonly used in analyzing and designing feedback control systems, is effective for linear, time-invariant systems. However, it falls short when dealing with nonlinear, time-varying, and multiple-input multiple-output systems. The time-domain or state-space approach addresses these limitations by utilizing state variables to construct simultaneous, first-order differential equations, known as state equations, for an nth-order system.
Consider an RLC circuit, a...

State Space to Transfer Function

State Space to Transfer Function

The conversion of state-space representation to a transfer function is a fundamental process in system analysis. It provides a method for transitioning from a time-domain description to a frequency-domain representation, which is crucial for simplifying the analysis and design of control systems.
The transformation process begins with the state-space representation, characterized by the state equation and the output equation. These equations are typically represented as:

Transfer Function to State Space

Transfer Function to State Space

State-space representation is a powerful tool for simulating physical systems on digital computers, necessitating the conversion of the transfer function into state-space form. Consider an nth-order linear differential equation with constant coefficients, like those encountered in an RLC circuit. The state variables are selected as the output and its n−1 derivatives. Differentiating these variables and substituting them back into the original equation produces the state equations.
In an RLC...

Relation between Mathematical Equations and Block Diagrams

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.

Signal Flow Graphs

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

SFG Algebra

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

You might also read

Related Articles

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

Sort by

Same author

Hidden Order of Boolean Networks.

IEEE transactions on neural networks and learning systems·2022

Same author

Efficient Algorithm for Approximating Nash Equilibrium of Distributed Aggregative Games.

IEEE transactions on cybernetics·2022

Same author

Optimization via game theoretic control.

National science review·2021

Same author

Doped metasurfaces: Etched structure-free flims based on regular spatially doped semiconductor and compatible with general optical ones.

iScience·2021

Same author

Self-Triggered Scheduling for Boolean Control Networks.

IEEE transactions on cybernetics·2021

Same author

Model-Free Reinforcement Learning by Embedding an Auxiliary System for Optimal Control of Nonlinear Systems.

IEEE transactions on neural networks and learning systems·2020

Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013

Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011

Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011

Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011

Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011

Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 16, 2026

Gene Digital Circuits Based on CRISPR-Cas Systems and Anti-CRISPR Proteins

Gene Digital Circuits Based on CRISPR-Cas Systems and Anti-CRISPR Proteins

Published on: October 18, 2022

State-space analysis of Boolean networks.

Daizhan Cheng¹, Hongsheng Qi

¹Academy of Mathematics and Systems Sciences, Chinese Academy of Sciences, Beijing, China. dcheng@iss.ac.cn

IEEE Transactions on Neural Networks

|February 23, 2010

Summary

This summary is machine-generated.

This study introduces a state-space framework for Boolean networks, converting logical dynamics into standard equations. It defines key subspaces and presents algorithms for analyzing network structures.

Related Experiment Videos

Last Updated: Jun 16, 2026

Gene Digital Circuits Based on CRISPR-Cas Systems and Anti-CRISPR Proteins

Gene Digital Circuits Based on CRISPR-Cas Systems and Anti-CRISPR Proteins

Published on: October 18, 2022

Area of Science:

Systems Biology
Control Theory
Computational Neuroscience

Background:

Boolean networks are widely used to model complex biological and computational systems.
Analyzing the dynamics and structure of these networks is crucial for understanding their behavior.
Existing methods may not fully capture the intricacies of Boolean network dynamics.

Purpose of the Study:

To establish a comprehensive state-space framework for Boolean networks.
To define and analyze critical subspaces within Boolean networks.
To develop algorithms for verifying these subspaces and revealing network structures.

Main Methods:

Utilizing the semitensor product of matrices to convert logical dynamics into standard discrete-time dynamics.
Defining and constructing bases for state space and its subspaces.
Precisely defining regular, Y-friendly, and invariant subspaces with associated verification algorithms.

Main Results:

A unified state-space representation for Boolean networks has been developed.
Key subspaces (regular, Y-friendly, invariant) are formally defined and characterized.
Algorithms for verifying these subspaces are presented, enabling detailed structural analysis.
The framework revealed the indistinct rolling gear structure of a Boolean network.

Conclusions:

The state-space approach provides a powerful framework for analyzing Boolean networks.
The defined subspaces and algorithms offer new tools for understanding network properties and dynamics.
This methodology facilitates the revelation of underlying network structures and their implications.