Model checking is a widely used technique in verification of dynamic systems. Recently several papers have shown that model checking can be used to do planning. In the present paper we report the results of a set of experiments on using two wellknown model checkers, Spin and SMV, to do traditional planning (i.e, planning in a complete information setting for reaching a state where a certain goal is satisfied). In the experiments we have compared the performances of such model checkers with stateof-art planners, IPP, FF, and TLPLAN, on problems used in AIPS'98 and AIPS'OO competitions
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.