Stability and robustness of discrete event dynamic systems

From MaRDI portal





It is supposed that a discrete event dynamic system (DEDS) is modelled via a finite automaton \(G = ( \Sigma , Q , \delta , q_{0}, Q_{m})\), where \(\Sigma\) is an alphabet of event labels, \(Q\) is a set of states, \(q_{0}\) is the initial state, \(Q_{m}\) is the set of marked states and \(\delta : \Sigma \times Q \to Q\) is a (possibly partial) transition mapping. The DEDS is controlled by some supervisor \((S, \varphi)\), where \(S\) is a finite automaton which recognizes a language over \(\Sigma\) and \(\varphi\) is a mapping which enables or disables controllable events over \(\Sigma\). The notions of stable, asymptotically stable and asymptotically stabilizable invariant sets (in the sense of Lyapunov with given resiliency radii) of \(G\) are determined and their properties are investigated. Corresponding criteria are established. A technique for stability analysis is developed. The obtained results are generalized to the investigation of robust stability and stabilizability respectively to the common invariant set of a given class of models. An example illustrating the obtained results is considered in detail.











This page was built for publication: Stability and robustness of discrete event dynamic systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4355343)