a rooted tableau for bctl：一个根深蒂固的画面bctl.pdfVIP

Available online at Electronic Notes in Theoretical Computer Science 278 (2011) 145–158 /locate/entcs A Rooted Tableau for BCTL* c John Christopher M Cabe-Dansted Computer Science and Software Engineering University of Western Australia Perth, Austrlia Abstract The existing pure tableau technique for satisfiability checking BCTL* [7] begins by constructing all possible colours. Traditional tableaux begin with a single root node, and only construct formulae that are derived from that root. These rooted tableaux provide much better performance on most real world formulae, as they only need to construct a fraction of the possible nodes. We present a rooted variant of this tableau for BCTL*, together with an implementation demonstrating the performance of our rooted variant is superior to the original; this implementation is made available as a Java applet. We discuss further possible optimisations. This research will be useful in finding an optimised rooted tableau for CTL*. Keywords: Full Computation Tree Logic, BCTL*, Tableau, Bundled. 1 Introduction There has been recent renewed interest in decision procedures for Full Computation Tree Logic (CTL*). It has long been known that CTL* is decidable and is 2EXP- TIME complete, [1,2] provides a doubly exponential automaton based satisfiability checker, and [9] gives a lower-bound. The automaton based satisfiability checkers are expected to have poor performance on average and have not been implemented [3]. Recently, tableau based decision procedures have been propos