Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  present a conversion algorithm to translate a linear temporal logic (LTL) formula to a Buchi automaton (BA) directly. A label, acceptance degree (AD), is presented to record acceptance conditions satisfied in each state or transition of an automaton. The AD for an automaton is a set of {U, F, R, G}-subformula of the given LTL formula. According to ADs attached to states and transitions, the on-the-fly de-generalization algorithm is presented. This on-the-fly de-generalization algorithm is used to transform a generalized Buchi automaton (GBA) into a Buchi automaton. It is different from the execution of the classic de-generalization algorithm that the on-the-fly de-generalization algorithm is performed during the expansion of the given LTL formula. A direct conversion algorithm based on the on-the-fly de-generalization algorithm is conceived and implemented.  compare the conversion algorithm presented in this paper with previous works, and show that it is more efficient for a series of formulae in usual use and random formulae generated by LBTT 1.2.1 (an LTL-to-BA translator testbench).
['L. Y. Shan', 'Zheng Qin', 'Kaiping Xu', 'Xu Chen', 'Zhipeng Li']
I am writing a research paper on a idea From LTL Formulae to Büchi Automata: A Direct Translation Using On-the-Fly De-Generalization.
[{"from": "human", "value": "I am writing a research paper on a idea From LTL Formulae to B\u00fcchi Automata: A Direct Translation Using On-the-Fly De-Generalization."}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: ,  present a conversion algorithm to translate a linear temporal logic (LTL) formula to a Buchi automaton (BA) directly. A label, acceptance degree (AD), is presented to record acceptance conditions satisfied in each state or transition of an automaton. The AD for an automaton is a set of {U, F, R, G}-subformula of the given LTL formula. According to ADs attached to states and transitions, the on-the-fly de-generalization algorithm is presented. This on-the-fly de-generalization algorithm is used to transform a generalized Buchi automaton (GBA) into a Buchi automaton. It is different from the execution of the classic de-generalization algorithm that the on-the-fly de-generalization algorithm is performed during the expansion of the given LTL formula. A direct conversion algorithm based on the on-the-fly de-generalization algorithm is conceived and implemented.  compare the conversion algorithm presented in this paper with previous works, and show that it is more efficient for a series of formulae in usual use and random formulae generated by LBTT 1.2.1 (an LTL-to-BA translator testbench)."}]