Incremental Verification for On-the-Fly Controller Synthesis
Electronic Notes in Theoretical Computer Science (ENTCS)
The Knowledge Engineering Review
Analyzing Flexible Timeline-based Plans
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Dependable and Historic Computing
Flexible Plan Verification: Feasibility Results
Fundamenta Informaticae - RCRA 2009 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
| Hi-index | 0.00 |
Planning and Model Checking are similar in concept. They both deal with reaching a goal state from an initial state by applying specified rules that allow for the transition from one state to another. Exploring the relationship between them is an interesting new research area. We are interested in planning frameworks that combine both planning and scheduling. For that, we focus our attention on real time model checking. As a first step, we developed a mapping from planning domain models into timed automata. Since timed automata are the representation structure of real-time model checkers, we are able to exploit what model checking has to offer for planning domains. In this paper we present the mapping algorithm, which involves translating temporal specifications into timed automata, and list some of the planning domain questions someone can answer by using model checking.