Abstract
Model checking is an automatic technique for verifying finite state concurrent systems. A rapid solution for the model checking problem is checking the emptiness of product Buchi automaton (BA) of the automaton for finite system and the one for the linear temporal logic (LTL) formula, so the algorithm for transforming LTL formula to BA is one of the bases of the whole model checking procedure. In this article, we propose a new efficient algorithm for transforming LTL formula to BA basing on analysis of the tableau structures of LTL formulae, which could efficiently reduce the size of the automaton, but not increases the spatiotemporal complexity, potentially the efficiency of the whole procedure of verification can be improved.
Sign-in/Register to access full text options 
Free) 
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
