摘要
本文用图论的方法构造出适宜用自动机建模的离散事件系统的布尔矩阵,通过对布尔矩阵的运算,既可得出系统可达状态集与转移的最短路径,为藉此设计最优监控器打下基础。
By the graph theory means,the boolean matrix was constructed for the discrete event systems that can be modeled by the automata in this paper. After calculating between the boolean matrice, the accessible state set and the shortest transition path was obtainesd. on which the optimal supervisory control may be designed.
关键词
离散事件系统
布尔矩阵
最优控制
图论
Discrete event systems Boolean matrix Supervisory control Reachability Optimal control