Efficient Decision Procedures for Model Checking of Linear Time Logic Properties [chapter]

Roderick Bloem, Kavita Ravi, Fabio Somenzi
1999 Lecture Notes in Computer Science  
We propose an algorithm for LTL model checking based on the classification of the automata and on guided symbolic search. Like most current methods for LTL model checking, our algorithm starts with a tableau construction and uses a model checker for CTL with fairness constraints to prove the existence of fair paths. However, we classify the tableaux according to their structure, and use efficient decision procedures for each class. Guided search applies hints to constrain the transition
more » ... during fixpoint computations. Each fixpoint is thus translated into a sequence of fixpoints that are often much easier to compute than the original one. Our preliminary experimental results suggest that the new algorithm for LTL is quite efficient. In fact, for properties that can be expressed in both CTL and LTL, the algorithm is competitive with the CTL model checking algorithm.
doi:10.1007/3-540-48683-6_21 fatcat:z2kfkg4syrbklb7zn7g2ybgmsy