Fuzzy automata plays an important part in automata theory and basic research.However,it is of pivotal im-portance to know how to construct the automata.A method for converting the generalized possibility LTL formulae into fuzzy alternating Büchi automata is worked out and then subj ected to induction and proof test.The results show that the language recognized by fuzzy Büchi alternating automata is consistent with the language recognized by the generalized possibilistic LTL formulae.%模糊自动机是自动机理论与基础研究的一个重要内容。然而如何对模糊自动机进行构造至关重要。在给出广义可能测度下线性时序逻辑语构公式所对应模糊交替 Büchi 自动机构造方法基础上，并对其归纳验证。结果表明，模糊交替Büchi自动机所识别的语言与广义可能测度下线性时序逻辑公式语义一致。
展开▼
