%0 Journal Article
%T Algorithms with polynomial complexity for determining the stability of nondeterministic discrete-event systems<br>判定非确定离散事件系统稳定性的多项式复杂度算法
%A SHU Shao-long
%A LIU Jun
%A <br>舒少龙
%A 刘君
%J 控制理论与应用
%D 2009
%I 
%X 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.
%K non-deterministic automata/languages
%K stability
%K gradient search
%K polynomial complexity<br>非确定自动机/形式语言模型
%K 稳定性
%K 梯度搜索
%K 多项式复杂度
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=970898A57DFC021F93AB51667BAED7F7&aid=CDB568EE6D2C0C7BB4958C0D22AABC47&yid=DE12191FBD62783C&vid=96C778EE049EE47D&iid=708DD6B15D2464E8&sid=8C8B0901DFA6ECA2&eid=49833082E2634437&journal_id=1000-8152&journal_name=控制理论与应用&referenced_num=0&reference_num=0