Abstract
In this paper, we present a conversion algorithm to translate a Linear temporal logic (LTL) formulato a Buchi automaton (BA) directly. Acceptance degree(AD) is presented to record acceptance conditions satisfied in each state and transition of the BA. According toAD, on-the-fly de-generalization algorithm, which is different from the standard de-generalization algorithm, isconceived and implemented. On-the-fly de-generalizationalgorithm is performed in the case of the given LTL formula containing U-subformulae or F-subformulae, that is,it is performed as required during the expansion of thegiven LTL formula. We compare the conversion algorithmpresented in this paper to previous works, and show thatit is more efficient for a series of LTL formulae in commonuse.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
