Enhanced Specification and Verification for Timed Planning
Abstract
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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 28, 2009
- Accession Number
- ADA495020
Entities
People
- Jin S. Dong
- Jun Sun
- Xian Zhang
Organizations
- National University of Singapore