Algorithms with polynomial complexity for determining the stability of nondeterministic discrete-event systems
判定非确定离散事件系统稳定性的多项式复杂度算法

The stability of discrete-event systems is studied based on nondeterministic automata/languages. The stability of nondeterministic discrete event systems is re-defined formally according to the definition of the quasi-distance between two states and state-subsets. An effective polynomial algorithm for determining the stability is proposed by investigating the state-pairs of the system.