Abstract
A new linear transformation from PLTL formulas to alternating automata is proposed in this paper. To this end, C-F normal forms and normal form graphs (NFGs) are defined for PLTL formulas. Further, based on NFGs, generalized alternating Buchi automata (GABA) of PLTL formulas are built. Beside the conciseness in theoretical aspect, the new transformation is useful in improving the scalability of LTL model checking tools in practise. Also, based on the new transformation, an intuitive on-the-fly model checking approach can be implemented.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
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 call
