breakdown-skill

Task decomposition converts a completed plan into atomic execution tasks with explicit dependencies. It breaks the specification into actionable work items with binary acceptance criteria to remove ambiguity before implementation begins.

Dependency mapping orders execution tasks so prerequisites are explicit and circular dependencies are caught early. It builds an acyclic dependency graph to support safe execution preparation and correct implementation sequencing.

Binary acceptance criteria are strict pass or fail completion checks applied to each decomposed task. They are required to ensure every atomic task has a definitive completion condition before execution sequencing begins.

Task decomposition applies directly to delivery planning workflows where a completed specification already exists. You provide the approved plan path and it generates execution-ready task files without altering the original validated plan.

Per-task estimates are required to achieve execution readiness. The decomposition process adds effort signals alongside binary acceptance criteria and acyclic dependency graphs to ensure safe implementation sequencing.