Extracting stable timed automata from switched model reference systems (Q4246820)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1301621
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Extracting stable timed automata from switched model reference systems |
scientific article; zbMATH DE number 1301621 |
Statements
10 January 2000
0 references
logical commutation
0 references
commutation timing
0 references
boundedness
0 references
switched systems
0 references
0.7365122437477112
0 references
0.7317665815353394
0 references
0.7310628890991211
0 references
0.73082035779953
0 references
Extracting stable timed automata from switched model reference systems (English)
0 references
The paper considers systems of the form \[ \begin{cases} \dot x & = A(\theta(t))x+ B_w(\theta(t)) w(t)+ B_u(\theta(t)) u(t),\\ z & = C_1x+ D_{12} u(t),\\ y & = x\end{cases} \] controlled by a multiple agent controller \[ \begin{cases} u & = K(m,x,t),\\ m & = D(x,u,t),\end{cases} \] where \(D\) is described logically as a commuting rule with \(K(m,x,t)\). It is shown that suitably commuted, the state variables of the controlled plant remain bounded. In particular boundedness is ensured provided some minimal time interval between switches is ensured. Stability and boundedness results are given for infinitely switched systems. For the entire collection see [Zbl 0909.00062].
0 references