Enhanced Specification and Verification for Timed Planning
Final rept. 12 Dec 2007-12 Dec 2008
NATIONAL UNIV OF SINGAPORE
Pagination or Media Count:
In this project, the PI introduced a specification language named Timed Planning, which is an extension of Timed CSP with the capability of stating more complicated timing behaviors for processes and events. They also developed a reasoning mechanism for Timed Planning based on Constraint Logic Programming. They model the Pearl Harbor Attack plan to demonstrate the capability of their approach for modeling time based military plans with critical timing constraints. Their approach is capable to handle the extended job-shop scheduling problems. In their work, the job shop scheduling problems with extensions can be naturally modeled as Timed Planning processes, whose complete executions correspond to feasible schedules. By using CLP based reasoning mechanism, the optimal scheduler which is an execution with the minimum execution time, can be found.
- Operations Research
- Computer Programming and Software