An Effective Tableau System for the Linear Time µ-Calculus

We present a tableau system for the model checking problem of the linear time µ-calculus. It improves the system of Stirling and Walker by simplifying the success condition for a tableau. In our system success for a leaf is determined by the path leading to it, whereas Stirling and Walker's method requires the examination of a potentially infinite number of paths extending over the whole tableau