Makespan Investigations of Sequential, Parallel, PO, and POCL Plans
AAAI 2026 Oral — proves makespan non-convertibility between POCL and Parallel Plans.
Computational Complexity
Concurrency, Convertibility, and Complexity in POCL Planning
This report presents investigations into the properties of Partial-Order Causal Link (POCL) plans.