The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Communication and concurrency
Theoretical Computer Science
DDL.1: a formal description of a constraint representation language for physical domains
New directions in AI planning
Model checking
Communicating sequential processes
Communications of the ACM - Special 25th Anniversary Issue
Lectures on Embedded Systems, European Educational Forum, School on Embedded Systems
Compositional and symbolic model-checking of real-time systems
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Mapping Temporal Planning Constraints into Timed Automata
TIME '01 Proceedings of the Eighth International Symposium on Temporal Representation and Reasoning (TIME'01)
Constraint-Based Attribute and Interval Planning
Constraints
Bridging the gap between planning and scheduling
The Knowledge Engineering Review
Efficient on-the-fly algorithms for the analysis of timed games
CONCUR 2005 - Concurrency Theory
Temporal dynamic controllability revisited
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Dynamic control of plans with temporal uncertainty
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
UPPAAL-Tiga: time for playing games!
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Flexible timeline-based plan verification
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
The Knowledge Engineering Review
Analyzing Flexible Timeline-based Plans
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Hi-index | 0.00 |
Timeline-based planning techniques have demonstrated wide application possibilities in heterogeneous real world domains. For a wider diffusion of this technology, a more thorough investigation of the connections with formal methods is needed. This paper is part of a research program aimed at studying the interconnections between timeline-based planning and standard techniques for formal validation and verification (V&V). In this line, an open issue consists of studying the link between plan generation and plan execution from the particular perspective of verifying temporal plans before their actual execution. The present work addresses the problem of verifying flexible temporal plans, i.e., those plans usually produced by least-commitment temporal planners. Such plans only impose minimal temporal constraints among the planned activities, hence are able to adapt to on-line environmental changes by trading some of the retained flexibility. This work shows how a model-checking verification tool based on Timed Game Automata (TGA) can be used to verify such plans. In particular, flexible plan verification is cast as a model-checking problem on those automata. The effectiveness of the proposed approach is shown by presenting a detailed experimental analysis with a real world domain which is used as a flexible benchmark.