Various concepts of stability has been proposed for discrete event systems (DES's). In this paper, a new concept of stability, called
Lf-stability, is proposed as an extension of the language stability proposed by Kumar et al. Intuitively, a DES
G is defined to be
Lf-stable w.r.t. a given prefix-closed language
K if the generated language
L (G) of the DES exists around
K. We show a necessary and sufficient condition for a DES to be
Lf-stable and to be
Lf-stabilizable. We also provide an on-line algorithm for computing an optimal stabilizing supervisor in the sense of minimally restrictive.
抄録全体を表示