一种求可观子语言的算法
An Algorithm Computing Observable Sublanguage
-
摘要: 给出了一种求解闭能观子语言的算法,该算法经m步(系统中离散事件个数)收敛,并且由 它求出的闭可观子语言总包括最大闭可识别子语言.Abstract: In this paper, an algorithm for computing the closed observable sublanguages is given. This algorithm converges within m steps (the number of discrete events in system). In addition, the closed observable sublanguages obtained from the algorithm always contains the maximal closed normal sublanguage.
-
Key words:
- supervisory control /
- observable language /
- normal language /
- discrete event systems
计量
- 文章访问数: 1973
- HTML全文浏览量: 88
- PDF下载量: 1145
- 被引次数: 0