Back to Search
Start Over
Stability and Guaranteed Cost Analysis of Time-Triggered Boolean Networks
- Source :
- IEEE transactions on neural networks and learning systems. 29(8)
- Publication Year :
- 2017
-
Abstract
- This paper investigates stability and guaranteed cost of time-triggered Boolean networks (BNs) based on the semitensor product of matrices. The time triggering is generated by mode-dependent average dwell-time switching signals in the BNs. With the help of the copositive Lyapunov function, a sufficient condition is derived to ensure that the considered network is globally stable under a designed average dwell-time switching signal. Subsequently, an infinite time cost function is further discussed and its bound is presented according to the obtained stability result. Numerical examples are finally given to show the feasibility of the theoretical results.
- Subjects :
- Lyapunov function
0209 industrial biotechnology
Computer Networks and Communications
Computer science
02 engineering and technology
Function (mathematics)
Stability (probability)
Computer Science Applications
Matrix (mathematics)
symbols.namesake
020901 industrial engineering & automation
Artificial Intelligence
Control theory
Product (mathematics)
0202 electrical engineering, electronic engineering, information engineering
Cost analysis
symbols
020201 artificial intelligence & image processing
Software
Numerical stability
Subjects
Details
- ISSN :
- 21622388
- Volume :
- 29
- Issue :
- 8
- Database :
- OpenAIRE
- Journal :
- IEEE transactions on neural networks and learning systems
- Accession number :
- edsair.doi.dedup.....81b4cd60e30c5ee568a915ddcfc6ff53