摘要
讨论基于自动机/形式语言模型的离散事件系统(DES)稳定性问题,引入了确定性离散事件系统N步稳定性定义,并得到了稳定性的判据定理,推导了具体的算法实现。该算法具有多项式复杂度。
N-stability of discrete event systems based on automata/languages is studied.The N-stability definition of DES is presented and the criterions for checking N-stability are discussed.Finally an effective algorithm is derived and it proves to be of polynomial complexity in time and space.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第7期17-19,共3页
Computer Engineering and Applications
基金
美国国家科学基金项目(the National Science Foundation of USA under Grant No.INT- 0213651)