C.24:4.1 - Owned planning operations
C.24 owns only planning and replanning:
planCalls(
actionBasis,
objective,
admittedMethodRefs,
routeDescriptionRefs?,
budget
) -> CallPlan
revisePlan(
currentCallPlanRef,
checkpointOrSignalRefs,
residualBudget
) -> CallPlan | CheckpointReturn | neighborExit
A.3.1 supplies Method admission. The action basis fixes the action or option being planned; it does not admit the Methods chosen for plan steps.
A domain-prescribed basis carries its Method, prescription, required action, applicability and stop conditions. Permission and authority remain independently governed. An A.15.7 basis keeps the selected action, deciding System, intended performer, action-changing fact, relevant domain-Method limit, and stop or feedback condition. A C.11 basis is a ChoiceResult whose lawful result is choose now; probe again, reject current set, and reroute do not fix an action for C.24.
C.18 may supply generated candidate or front material, and C.19 may supply a live-pool treatment that informed the decision; neither record admits a Method. Comparison comes from the selected evaluation Method and, when scale preference is claimed, C.19.1.
A.15.1 governs the actual call or observation Work; G.6 provides a trace representation when those independently established facts, results and provenance relations must remain replayable. C.24 only constrains what the plan or checkpoint must retain for those later uses.
To construct the route, use the backward construction and forward check in OPS.11.1:4.2–4.3 for this fixed action:
- Recover usable contributions. Read the available Methods and any needed route descriptions for the results they supply, required inputs, preconditions, relevant effects and limits. Resolve missing interface meaning from the maintained description or provider. Begin with the action’s receiving completion conditions.
- Work backwards from the required result. Choose an admitted Method that can supply it. For each input not already available, find a qualified preceding Method or an available source that supplies it. Continue until the route reaches available inputs. Keep required joins and enabling conditions. If a contribution cannot be supplied, return that particular gap rather than adding an ungrounded call.
- Check forwards from the available inputs. Follow the proposed outputs into the next inputs. Check consequential units, scope, access, timing and other use conditions. Reconcile shared resources and applicable budget. Elapsed time is not the sum of resource expenditure when calls overlap. Reuse established interface and performance bounds where adequate. Compare the final output with the result promised to the recipient. If a call only prepares the input for delivery or acceptance, include the work still needed and its time and entry conditions in the plan.
- Return the route or the unresolved question. State the calls, useful intermediate results, required ordering or safe parallelism, shared resources and stop or replan conditions. When a later call depends on an earlier result, specify what the person or system making that choice will know in time and what it can then do. For a guaranteed result, check the remaining budget and completion conditions on every reachable branch. If the deciding information arrives after an irreversible choice, establish a route that works across the cases still possible then, or report the missing condition. Use §4.2 for a bounded scout when its result could resolve that question at justified cost. A changed action returns to its selecting Method.