Abstract: We present a tableau system for the model checking problem of the linear time /*-calculus. It improves the system of Stifling 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 Stifling and Walker's method requires the examination of a potentially infinite number of paths extending over the whole tableau.
Later, Bradfield, Esparza and Mader REF improve the system of Stirling and Walker by simplifying the success conditions for a tableau.
An effective tableau system for the linear time μ-calculus
ICALP
Mathematics Computer Science