摘要
本文给出一种求闭能观子语言的算法,该算法经m步(系统中离散事件个数)收敛;并且证明无论对系统中事件如何排序,由该算法求出的闭能观子语言总包含最大闭可识别子语言。
In this paper, an algorithm for computing closed observable sublanguages is given, which will converge within m steps (the number of discrete events in system). In addition, no matter how the events In system are sequenced, the. closed observable sublanguages got from the algorithm always contains the supremal closed normal sublanguage.
出处
《控制理论与应用》
EI
CAS
CSCD
北大核心
1993年第6期670-675,共6页
Control Theory & Applications
关键词
离散事件
闭可观子语言
discrete event systems
supervisory control
observable language
