Method in six moves. Define the task, identify the implementing components, join their provided and required capabilities, retain compatible alternatives, evaluate their resources, and query the minimal tuples. The feedback panel is a separate affine resource calculation; it is not a general solver for cyclic co-design diagrams.
What to ask the component teams
Before modelling a real programme, ask each team for alternatives: what each can provide, what it requires from other components, and the resources it consumes, with units, evidence and a stated validity range. For the crossing, ask the structure team for width and land/cost options, the landscape team for guiding-fence obligations, and the monitoring team for observation and staffing options. Agree which provided capability satisfies each requirement before comparing complete designs.
Keep permissions and stakeholder decisions explicit. A compatible model supplies evidence for discussion; it does not grant approval. This practical habit is retained from the earlier director’s guide; its unchecked calculator is superseded by the four current essais.
1 · Define the task
The task is: deliver corridor model crossing capability under explicit ceilings on budget, time, and programme risk. The page treats this as the top-level function and keeps implementation choices separate from it.
2 · Functional decomposition
The external function is model crossing capability. A habitat plan specifies width and connected catchment; the three package catalogues provide the capabilities required by that plan. A works implementation also includes a governance choice and a supplied staging pattern. The no-project implementation uses compatible baseline assets.
3 · From decomposition to co-design diagram
The actual joins are explicit: crossing width ≥ planned width; guide-fence length ≥ max(planned catchment, the width-induced minimum); camera stations ≥ the rounded-up survey coverage requirement. The selected tuple’s checks are shown in the Brief. Diagram arrows illustrate these dependencies; they do not simulate animal behaviour.
4 · Populate implementations
The implementation set is the compatible subset of the Cartesian product of the finite catalogues, with the habitat plan and programme alternatives retained. Flat enumeration computes these joins directly. The catalogue relation is discrete; readiness sampling and risk assumptions remain approximations of the chosen scenario.
5 · Solve by querying minimal resources
For the requested model crossing capability, the solver retains all compatible implementations that meet the declared ceilings, then finds the minimal resource tuples across them. Raising only the model crossing capability request removes implementations; it never changes a fixed implementation’s cost or risk.
6 · Treat loops explicitly
For a fixed implementation, the supplied affine map is r = B + 0.72q + 0.222P + 0.42αr. Every supplied α gives slope below one, so the exact solution is r = (B + 0.72q + 0.222P)/(1 − 0.42α). The trace illustrates iteration; the resource evaluation uses this exact result.
Stylised modelling choices in this scenario
Capacity requirement maps are non-decreasing; resource bundles are Pareto-filtered. Sequencing is restricted to four supplied strategies. Readiness is linearly interpolated within work stages and mismatch is sampled at 120 intervals; it is not certified animal passage during works. The feedback calculation is a scalar evaluator, not a general MCDP loop solver. Resource ceilings of zero are unconstrained; there are no hidden duration or risk cutoffs. The no-project option has zero incremental resources only when the baseline packages are compatible and meet the task.