首页 | 本学科首页   官方微博 | 高级检索  
     


Testing Planning Domains (without Model Checkers)
Authors:Franco Raimondi   Charles Pecheur  Guillaume Brat  
Affiliation:aDepartment of Computer Science, University College London, London, UK;bDept. INGI, Université catholique de Louvain, Louvain-la-neuve, Belgium;cRIACS/NASA Ames Research Center, Moffett Field, CA, USA
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 self-contained, 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.
Keywords:Specification-based Testing   Planning   Coverage criteria
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号