基于乘积张量算法的模糊离散事件系统自动机组合及应用

Fuzzy Automaton Composition and Its Application Based on Tensor Product Algorithm

对已有的状态转移规则进行分析与比较,结合最大乘积状态转移规则提出一种基于乘积张量的自动机组合方法,并结合实例证明了基于乘积张量的模糊离散事件系统自动机状态转移定理.结果表明,在进行自动机组合时,各自动机先进行状态转移再组合与先进行组合再状态转移得到的结果是一致的,2种不同的运算顺序在运算复杂度及运算量方面具有相对优越性,但前一种运算顺序在组合复杂度及运算时间方面都要比后一种更为优越.

After analyzing and comparing the state transition rules available, this paper proposed an automaton combi- nation method based on tensor product and proved the theorem of fuzzy discrete event systems state transition with examples. The findings show that during the automaton combinations, the combination orders of the state transition prior to combination, or combination prior to state transition of automatons did not affect the results. Comparatively, both mathematical operations have an advantage in computing complexity as well as in computation, but the former operation order works better than the latter in combination complexity and operation time.