Related Experiment Video
Updated: Jan 20, 2026

Assessment of Open Probability of the Mitochondrial Permeability Transition Pore in the Setting of Coenzyme Q Excess
Published on: June 1, 2022
Reachable Set Estimation for Discrete-Time Markovian Jump Neural Networks With Generally Incomplete Transition
Abstract:
This paper is concerned with the problem of reachable set estimation for discrete-time Markovian jump neural networks with generally incomplete transition probabilities (TPs). This kind of TP may be exactly known, merely known with lower and upper bounds, or unknown. The aim of this paper is to derive a precise reachable set description for the considered system via the Lyapunov-Krasovskii functional (LKF) approach. By constructing an augmented LKF, using an equivalent transformation method to deal with the unknown TPs and utilizing the extended reciprocally convex matrix inequality, and the free matrix weighting approach to estimate the forward difference of the constructed LKF, several sufficient conditions that guarantee the existence of an ellipsoidal reachable set are established. Finally, a numerical example with simulation results is given to demonstrate the effectiveness and superiority of the proposed results.
Related Concept Videos
Discrete-time Fourier transform
One of the notable...
Basic Discrete Time Signals
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
Discrete-Time Fourier Series
For a discrete-time periodic signal x[n]...
Probability Laws
Setting Time of Cement
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....

