A method to generate formulas for temporal logic satisfiability checkers

In order to evaluate the performance of temporal logic satisfiability checkers, a benchmark with test formulas is required, as well as analysis of the complexity of algorithms. However, there seem to be no clear criteria of the formulas for benchmarks. Thus, to evaluate the performance of satisfiability checkers for new logics, we must prepare test formulas for the logic. In this paper, we propose a systematic method to generate formulas of two-way CTL, which are intended to be benchmark formulas for satisfiability checkers. We also discuss the criteria of test formulas. Finally, we present formulas obtained by our method and describe the results of experiments with our two-way CTL satisfiability checker. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 90(11): 99– 108, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.20410