Testing Planning Domains (without Model Checkers)

Abstract

We address the problem of verifying planning domains as used in model-based planning, for example in space missions. We propose a methodology for testing flight rules of planning domains which is selfcontained, in the sense that flight rules are verified using a planner and no external tools are required. We review and analyse coverage conditions for requirements-based testing, and we reason in detail on ”Unique First Cause” (UFC) coverage for test suites. We characterise flight rules using patterns, encoded using LTL, and we provide UFC coverage for them. We then present a translation of LTL formulae into planning goals, and illustrate our approach on a case study.

DOI: 10.1016/j.entcs.2007.08.011

7 Figures and Tables

Cite this paper

@article{Raimondi2007TestingPD, title={Testing Planning Domains (without Model Checkers)}, author={Franco Raimondi and Charles Pecheur and Guillaume Brat}, journal={Electr. Notes Theor. Comput. Sci.}, year={2007}, volume={190}, pages={113-125} }