A.6.7 - MechSuiteDescription — Shared Conditions for Joint Use of Distinct Mechanisms
Type: Architectural pattern. Status: Stable. Normativity: Normative [A] (Core).
Use this when. Several distinct mechanism declarations must be used together under shared conditions. Select their contracts and cite the required specifications. State a permitted operation order when joint use needs a protocol.
First useful result. The distinct member declarations, their joint conditions and required specification references are recoverable. Each declared protocol step also resolves to one member declaration edition and one operation in that declaration. Two implementations of the same declaration do not become two members.
Not this pattern when. Use A.6.1 for one reusable operation-family declaration, A.3.1 for a way of doing, and A.15.2 for an ordinary plan or edition baseline. A suite is useful only when several declarations have joint conditions to express.
A MechSuiteDescription describes a finite set of distinct mechanism declaration contracts, their shared obligations and required specification references, with any declared protocols and audit requirements. Two realizations of one contract remain one member. The description is distinct from a MechFamilyDescription and a publication Pack.
Plain-name. mechanism suite description; mechanism suite passport.
Builds on. A.6.1 (U.Mechanism canonical form), A.6.5 (SlotSpecs where a RelationSignature is current), E.10 (lexical + ontological rules; strict distinction; minimal specificity; kind suffixes), E.18 (transformation-flow structure and crossing visibility), E.18.1 (P2W carry-through), A.21 (gate-level decisions).
Used by. Mechanism stacks governed by shared admissibility, transport and audit obligations and operation declarations, including shared suites reused by Part G patterns such as G.5.
Declared vocabulary and references.
- Declares:
MechSuiteDescription(KernelToken, Description) and the record names used by its canonical form:MechSuiteId,SuiteObligation,SuiteObligations,SuiteSpecPins,SuiteProtocol,ProtocolStep,SuiteAuditObligations. - Reuses (by reference):
U.Mechanism(members),MechFamilyDescription/MechInstanceDescription(optional citations), existing pinned references such asCN‑Spec/CG‑Spec(as pins), and E.18/P2W notions (as obligations/pins), without introducing new U-kinds.
LEX.TokenClass.
LEX.TokenClass(MechSuiteDescription) = KernelToken.LEX.TokenClass(MechSuiteId) = KernelToken.LEX.TokenClass(SuiteObligations) = KernelToken.LEX.TokenClass(SuiteSpecPins) = KernelToken.LEX.TokenClass(SuiteProtocol) = KernelToken.LEX.TokenClass(SuiteAuditObligations) = KernelToken.
EntityOfConcern. A finite set of distinct mechanism declarations intended for joint use. The description’s Tech name ends with …Description.
Lexical note: do not prefix this token with U.. The U.* namespace is for admitted U-kinds and governed kernel values; MechSuiteDescription is a description value for a suite of mechanism declarations, not a root kind.
A.6.7:1 - Problem frame
An A.6.1 U.Mechanism declares its operations, arguments, results, laws, guards and any transport or audit conditions. Some architectures need several distinct declarations to be used together under shared conditions: for example, a characterization chain or an admissibility-gated selection protocol. The suite description states those joint conditions without redefining the member operations.
FPF already has MechFamilyDescription, but its meaning is: many realizations of one and the same U.Mechanism. That construct cannot correctly represent a bundle of different mechanisms (different declarations), and trying to overload it creates a level error.
Additionally, FPF reserves “Pack” for publication/shipping bundling (e.g., G.10); using “Pack” to mean “container of mechanisms” creates ontological collisions and downstream confusion.
A.6.7:2 - Problem
The suite user needs one description that can:
-
represent a set of distinct mechanisms (distinct
U.Mechanism), -
declare shared obligations that must hold across the set (e.g., crossing visibility, admissibility-citation discipline, guard decision format, penalty routing),
-
provide shared spec pins (e.g., “this suite is governed by CN-Spec and CG-Spec”), without duplicating those spec contents,
-
constrain allowed protocols of use (allowed pipelines / permitted ordering), without turning the suite into a mechanism, and
-
preserve the distinction among:
- a description of several distinct mechanism contracts (
MechSuiteDescription), - a description of realizations of one contract (
MechFamilyDescription), - a publication bundle (
Pack, e.g., G.10).
- a description of several distinct mechanism contracts (
A.6.7:3 - Forces
-
Strict distinction (level hygiene). “many mechanisms” must not be encoded as “many realizations of one mechanism”. Violating this blurs specialization laws, mechanism-declaration invariants, and audit/crossing responsibilities.
-
Minimal specificity + kind suffix discipline (E.10). The token name should encode only what is essential: it is a description, it is about mechanisms, it is a suite. It must not capture a domain (e.g., CHR) in the Kernel name.
-
Governing spec ref centrality (CN‑Spec and CG‑Spec). Suites must cite governing spec refs as pins, not duplicate their internals, otherwise multiple competing admissibility centers arise.
-
Transport and crossing visibility discipline. A claimed semantic correspondence between different local interpretation bases needs its obtaining F.9 Bridge; a kind correspondence needs its C.3.3 basis; a plane relation retains its own defining rule. Expose the anchors required by each actual relation and receiving use. An independently governed E.18 crossing or A.21 gate retains its required bundle or gate evidence. Assess loss under the receiving-use rule; apply the model-bound penalty conditions in §4.2(2). Suites do not embed CL/Φ/Ψ/Φ_plane tables.
-
Guard vs gate separation. Mechanisms can output tri-state guard outcomes and explanations; gate decisions (including
block) andDecisionLogremain gate-level (OperationalGate(profile)). A suite must not collapse these layers. -
Description and actual use. Shared conditions constrain later use; they are not that use or its results. Implementation references may be cited under their own rules, while member declarations retain the operation semantics.
A.6.7:4 - Solution
Declare the members and their shared conditions in a MechSuiteDescription:
A.6.7:4.1 - MechSuiteDescription (data model)
MechSuiteDescription declares:
- Suite identifier: a stable identifier for downstream citation.
- Membership: a finite set of distinct mechanism declarations.
- Suite obligations: shared invariants that every member (and any permitted composition of members) must respect.
- Suite spec pins: required citations/pins to governing spec refs and other “anchor” references.
- Suite protocols, when needed: allowed pipelines of use (permitted ordering and optional steps), expressed at the descriptive level.
- Suite audit obligations, when needed by downstream use: required audit/pin visibility (UTS/Path pins, crossing pins, guard pins), expressed as required anchors (not run-time values).
- Notes: optional explanations or boundaries needed to interpret or use the suite.
A minimal canonical form:
MechSuiteId := Identifier // PascalCase; stable citation handle. Versioning MAY be carried externally.
SuiteObligation := declared suite-level obligation
// Canonical reusable names (not exhaustive):
// semantic_correspondence_requirements,
// independent_correspondence_requirements,
// transport_declarative_only,
// penalties_route_to_r_eff_only,
// guard_decision_tristate(pass|degrade|abstain),
// unknown_never_coerces_to_pass,
// gate_decision_separation,
// guard_lexeme_reservations,
// cg_spec_cite_required_for_numeric_ops,
// no_silent_scalarisation_of_partial_orders,
// no_silent_totalisation,
// no_thresholds_in_suite_core,
// crossing_visibility_required,
// planned_filling_in_workplan,
// actual_launch_facts_and_witness,
// implementation_export_discipline_when_cited
SuiteObligations := { SuiteObligation[*] } // clause set; duplicates-free.
MechSuiteDescription := ⟨
mech_suite_id: MechSuiteId ,
mechanisms: MechanismDeclarationRef[+] , // references to member declarations
suite_obligations: SuiteObligations ,
suite_spec_pins: SuiteSpecPins ,
suite_protocols?: SuiteProtocol[*] ,
suite_audit_obligations?: SuiteAuditObligations ,
suite_notes?: DidacticNotes
⟩
Norms.
- Suite identifier.
mech_suite_idMUST be present and stable: it is the citation handle for downstream planning and audit.
Well-formedness constraints (admissibility; non-deontic).
-
WF‑MS‑1 (Membership set semantics).
mechanismsresolves to pairwise distinct A.6.1 declaration epistemes under C.2.1 identity; field order carries no semantics. Two citations of the same declaration are one member. -
WF‑MS‑2 (Protocol closure and resolution). Every
ProtocolStep.mechanismresolves to one member declaration at its selected edition, andstep.operationresolves to one operation designator in that declaration. The selected operation supplies its arguments, results, laws and admission conditions. A stage label or unqualified family name is insufficient. -
WF‑MS‑3 (Suite ≠ Pack).
MechSuiteDescriptiondoes not carry shipping/publication payloads; use the applicable shipping or publication pattern for those results. -
WF‑MS‑4 (Suite ≠ Mechanism).
MechSuiteDescriptioncontains noOperationAlgebra/LawSet/execution semantics and is not admissible where aU.Mechanism.*node is required. -
Membership is by declaration (order-free).
mechanismsMUST resolve to a duplicates-free set of member declaration epistemes. Membership order has no semantics; intended ordering belongs insuite_protocols. Shared conditions and selected operations determine which joint uses the description permits.
Declaration reference and edition selection. MechanismDeclarationRef is a reference to an independently identified A.6.1 U.Mechanism episteme, not a new kind. Resolve it under the effective reference scheme to its content and EntityOfConcern. The published edition used for that resolution must be explicit or uniquely determined by the cited suite baseline. When several editions qualify, state a selection condition that yields one before using a protocol step; otherwise return the unresolved alternatives. There is no implicit latest.
Changing declaration content, EntityOfConcern or effective reference scheme follows A.6.1/C.2.1 identity. Changing a carrier, layout or citation alone can leave the member unchanged. A changed guard or argument selects a different declaration contract and requires the affected protocol bindings to be checked again. A claim that two declarations concern the same operation family needs that subject’s own identity rule; suite membership does not establish it. Distinct declaration contracts can be selected without inventing a universal operation-family kind. A change to a shared specification or policy similarly reopens the steps and downstream results that depend on it. Reuse unaffected conditions and results when their grounds still hold.
-
No substitution by
MechFamilyDescription. A suite MUST NOT be encoded as aMechFamilyDescription. If desired, a suite MAY additionally citeMechFamilyDescription/MechInstanceDescriptionfor members (e.g., “preferred realization for this context”), but such citations do not redefine membership. -
No “Pack” meaning. A suite MUST NOT be named or treated as a publication pack.
Packremains reserved for publication/shipping bundling (e.g., G.10). -
No mechanism semantics in the suite. A suite is a Description, not a mechanism: it does not define
OperationAlgebraand does not absorb gate logic.
A.6.7:4.2 - SuiteObligations (canonical obligation vocabulary)
A MechSuiteDescription may state additional shared obligations within the member contracts and applicable FPF rules. The names in §4.1 are reusable examples, not an exhaustive inventory.
SuiteObligations SHOULD be written as an explicit, duplicates-free clause set. Select applicable clauses from the canonical vocabulary in §4.1 and state any additional obligations explicitly. The requirements below remain applicable under their stated conditions.
Obligation meanings (normative).
-
semantic_correspondence_requirements. For an actual semantic correspondence between distinct recovered local senses, recover the F.17 endpoints and an obtaining F.9 Bridge, then the bounded-use and reliance claims required for this use. A suite creates none of those facts. A changed entity, reference scheme, plane or notation alone establishes no semantic crossing under A.6.4.1.1.
independent_correspondence_requirements.- When both an F.9 semantic correspondence and a C.3.3 kind correspondence are claimed, establish each under its direct rule. Any separately claimed plane relation keeps its own governor. Changing the EntityOfConcern alone creates neither relation. Retain the separate use conditions and applicable penalty policy; do not invent a second Bridge from the change label.
1.2.
transport_declarative_only.- Well-formedness constraint: suite obligations do not embed CL/Φ/Ψ/Φ_plane conversion or penalty tables. Transport obligations cite the applicable rules, pins and anchors; E.18 accounts for changed use bindings, and the applicable gate owns its decision. Distinct direct predicates retain their meanings and occurrence rules. Drawing an edge or declaring a suite obligation does not establish a relation, conversion or penalty.
-
penalties_route_to_r_eff_only. Well-formedness constraint: loss is assessed under the receiving-use rule and any tolerance it requires; a supported qualitative assessment can suffice. A numerical assurance penalty is used only when a named assurance claim consumes it under an applicable domain model in B.3:4.3–4.4, with the required dependency, calibration and unit assumptions. The selected model determines which result or results the penalty affects; apply anR/R_eff-only restriction only when that model establishes it. A penalty alone changes no legality, invariant orU.ClaimScopefact; those retain their own governing rules. -
guard_decision_tristate(pass|degrade|abstain)andunknown_never_coerces_to_pass. Well-formedness constraint: admissibility/eligibility outcomes use a tri-state guard resultGuardDecision := {pass|degrade|abstain}. Unknown/insufficient evidence is not coerced topass; it resolves to{degrade|abstain}under declared failure behavior (e.g., probe-only as a SoS‑LOG branch id, not as a new decision value). -
gate_decision_separation. Well-formedness constraint: suites do not define or useGateDecisionvalues (includingblock) as part of mechanism/suite semantics. Gate-level outcomes andDecisionLogremain onOperationalGate(profile). -
guard_lexeme_reservations. Well-formedness constraint:USM.CompareGuardandUSM.LaunchGuarddenote gate-owned guard events/pins; member mechanisms and suite protocols use…Admissibility/…Eligibilityfor guard predicates, not the reserved gate lexemes. -
cg_spec_cite_required_for_numeric_ops. For a suite whose numeric comparison, aggregation or scoring is admissibility-gated under CG-Spec, the relevant member operations cite that specification and its needed subrefs. Keep the admissibility content in the specification; a suite does not create a second local version. -
no_silent_scalarisation_of_partial_ordersandno_silent_totalisation. Well-formedness constraint: if a member mechanism induces a partial order, it preserves set-/relation-valued semantics; it does not silently reduce to a scalar/total order. Any totalization is explicit and policy-bound. -
no_thresholds_in_suite_core. Well-formedness constraint: suite core does not publish acceptance thresholds (“passing scores” / hidden cutoffs). Thresholds belong to acceptance clauses / task signatures / gate profiles. -
crossing_visibility_required. Well-formedness constraint: for each GateCrossing relevant to suite use, make its changed bindings, from/to values and establishing basis visible under E.18:5.1. Publish aCrossingBundlewhen a named downstream use relies on durable crossing evidence, including an applicable suite audit requirement under §4.5; that bundle can be cited as an audit anchor. Apply E.18 only for an independently selected TransformationFlowStructure and its actual governed crossing; apply A.21 for a current work-entry gate. An edition, entity or notation change alone supplies neither that crossing nor a semantic Bridge. Suites may requireCrossingBundleRef/ UTS / Path pins and policy-id pins as anchors, and MUST NOT embed CL/Φ/Ψ/Φ_plane tables. -
planned_filling_in_workplan. Any planned filling used as a baseline for suite use is content of an A.15.2U.WorkPlan; A.15.3 applies only to independently declared members. These are intended values under the plan’s conditions, preserved separately from later actual-use facts. -
actual_launch_facts_and_witness. For an actual launch claim under E.18:5.6, establish one independently admitted A.15.1 Work occurrence and the actual launch values through independently obtaining direct relations or A.6.1 application bindings. A separateFinalizeLaunchValuesepisteme may then designate that occurrence and those facts. A plan or suite requirement supplies none of those actual facts by itself.
A.6.7:4.3 - SuiteSpecPins
A MechSuiteDescription MUST be able to declare required spec pins as references, not as duplicated content. Canonically:
SuiteSpecPins := ⟨
required_spec_refs?: {CNSpecRef?, CGSpecRef?, ...},
required_edition_pins?: EditionPin[*],
required_policy_id_pins?: PolicyIdPin[*],
required_planned_baseline_ref?: PlannedBaselineRef?
⟩
Norms.
- If the suite is admissibility-gated for characterization,
CNSpecRefandCGSpecRefMUST be required (as references/pins). - Spec pins are citations and anchors. They do not replace the underlying
…Specobjects. - A suite may require an edition/reference baseline in ordinary A.15.2 WorkPlan content. Address it through the plan and its local content locator; it supplies no launch value or gate decision.
- Use A.15.3 typed planned filling only when an existing declaration member independently supplies the position meaning, designation, cardinality and actual-use predicate. A suite Description field is not a SlotSpec or operation argument merely because a plan names it. Missing planned information can remain unknown in the plan; a missing governor requires recovery or definition of that member before typed filling. Actual application bindings retain their A.6.1 predicates; Work admission is additionally needed when the claim consumes a dated Work occurrence. An actual launch claim and any separate
FinalizeLaunchValueswitness follow E.18:5.6.
A.6.7:4.4 - SuiteProtocols
A suite MAY describe allowed protocols (pipelines) as descriptive constraints on how suite members are intended to be composed. A SuiteProtocol describes the member-operation sequence. Its description:
- MUST name the member mechanisms it uses,
- MAY mark steps as optional,
- MUST NOT introduce hidden crossings or hidden admissibility steps,
- MUST identify any “publish/telemetry” as an external step of the surrounding protocol, realized through existing publication surfaces (e.g., Part G shipping), rather than as a hidden tail inside a mechanism. This external step is not a
ProtocolStepin the suite-member sequence.
A canonical shape for the suite-member sequence:
SuiteProtocol := ⟨
steps: [ ProtocolStep₁, …, ProtocolStepₙ ],
invariants?: ProtocolInvariant[*],
notes?: DidacticNotes
⟩
ProtocolStep := ⟨
mechanism: MechanismDeclarationRef, // resolves to the selected edition
operation: declaration-local operationDesignator,
optionality: {required|optional},
requires_pins?: PinRef[*]
⟩
A.6.7:4.5 - SuiteAuditObligations
A suite MAY require that downstream use provide audit anchors. These are requirements, not run-time values. A suite audit obligation MAY include:
- required
UTS+Pathpins, - required crossing-surface visibility pins for any crossing relevant to suite use,
- required presence of
USM.CompareGuardand/orUSM.LaunchGuardpins (not gate checks), - required declaration of guard ownership (e.g., a
GuardOwnerGateSlotanchor), - required expression of guard violations as
GuardFailevents aggregated by the guard-owning gate (perGuardOwnerGateSlot), not as extra mechanism/suite states, - required policy-id pins for any degrade/sandbox/probe-only branches (SoS‑LOG branch id anchors).
- required parity/selection-grade pins when applicable (e.g., when suite use claims parity-grade comparison/selection surfaces downstream).
Norm. A suite must never publish a DecisionLog or GateDecision. If the suite requires guard pins, it requires their presence as anchors so that the gate-level owner can aggregate GuardFails and decide degrade|block per gate profile.
A.6.7:4.6 - Examples
Example 1 — compare two offers and retain the nondominated set. The question is whether either offer can be discarded without accepting a worse cost or quality. This is a stipulated mathematical use; the following specifications and applications are case facts, not empirical measurements or dated Work claims.
Selected contracts and specifications. The baseline OfferChoiceB1 selects Dcmp = A.19.CPM §4.1 and Dsel = A.19.SelectorMechanism §4.1, including their operation-local declarations, application/binding predicates, identity and extent rules, in the same publication edition as this case. These references mean that edition’s content, not a later revision. Resolve another publication’s references again before reuse. Their effective scheme is the CHR reference scheme declared there.
The case’s independently stipulated specification editions are:
| Reference | Content consumed in this use |
|---|---|
OfferCN@1 | Admits exactly offers A and B with complete cost and quality profiles on OfferBasis@1. Comparability is componentwise on those same positions and scales, with no normalization requirement. Both candidates meet acceptance; there is no additional acceptance threshold. |
OfferCG@1 | Admits OfferPareto@1 in ComparatorSet. SCP permits order comparisons on each declared scale and conjunction of those comparisons; it permits no cross-characteristic addition. MinimalEvidence requires both exact profile values and their common basis. |
OfferPareto@1 | Lower cost and higher quality are better. X dominates Y iff X is no worse on both positions and strictly better on at least one. Equal profiles return parity; a trade-off returns the pair’s incomparability token. No epsilon or tie-breaker applies. |
OfferSelection@1 | Select every nondominated candidate. Compare every unordered pair once under OfferPareto@1. No singleton preference or hidden default applies. Missing required comparison, failed evidence or unknown value means abstain; no degrade branch is enabled. |
These definitions are the cited case specifications, outside the suite description. OfferBasis@1 gives position cost the price Characteristic and EUR ratio scale, and position quality the declared defect-free proportion Characteristic and a dimensionless ratio scale. The already admitted measure profiles are A=(10 EUR, 0.8), B=(12 EUR, 0.9). Both use these positions, with complete exact stipulated values.
Filled suite description. OfferChoiceSuiteDescription has mech_suite_id = OfferChoiceSuite, membership {Dcmp, Dsel}, required spec references {OfferCN@1, OfferCG@1}, and required policy/comparator references {OfferSelection@1, OfferPareto@1}. Its shared obligations are tri-state eligibility with unknown never passing, explicit numeric admissibility, set-valued comparison/selection without hidden scalarization or totalization, and gate-decision separation. The one protocol contains four required steps:
| Selected member | Operation | Required references |
|---|---|---|
| Dcmp | CompareEligibility | OfferCN@1, OfferCG@1, OfferPareto@1 |
| Dcmp | Compare | the same three references |
| Dsel | SelectEligibility | OfferCN@1, OfferCG@1, OfferSelection@1 |
| Dsel | Select | the same three references |
The protocol invariant requires both members to use the same admitted profiles, scope, slices, scheme, plane and evaluation point, and Select to consume the actual returned Compare binding. The audit obligation is to recover those effective arguments, eligibility judgments and output bindings, including token provenance. There is no public naming, semantic/kind/plane correspondence, flow crossing, gate, implementation export or planned-launch claim in this use, so it requires none of their conditional anchors. The description supplies no operation law or runtime output of its own.
Application and result. Outside the description, stipulate one completed application of each of the four selected operations, in the listed order. Each takes up the following arguments and ends at its own return; those four invocation episodes are distinct from the evaluation point they share. OfferScope@1 delimits the comparison and selection of A and B for this offer question; {OfferSlice@1} is its selected A.2.6 context-slice set. Both members bind that scope and set, the CHR reference scheme, the concept reference plane, and evaluation point 2030-01-01T00:00Z in UTC. No additional CharacteristicSpacePredicate or MinimalEvidence override is used. Normalization has no dependency because OfferCN@1 compares the original matched scales.
The comparator guard uses A as LeftProfileSlot and B as RightProfileSlot, with OfferCN@1, OfferCG@1 and OfferPareto@1, and returns pass: both profiles are complete, admitted and scale-compatible. Application c1 then returns ComparisonResultSlot = {A ∥ B}. Its returned binding, not an equal saved token, supplies the selection basis.
The selector guard binds CandidateSetSlot={A,B}, comparisonBasis={c1}, requiredComparisons={(A,B,OfferPareto@1)}, tokenProvenance={A ∥ B ↦ c1’s returned binding}, and ComparisonResultSlot={A ∥ B}. CriteriaSlot contains the single clause “retain all nondominated candidates”; selectorPolicy is OfferSelection@1; TaskSignatureSlot is absent because no default is obtained from it. CN, CG and the common use arguments are those above. Coverage is complete and the guard returns pass. Select consumes that eligibility result and returns SelectionSlot = {A,B}. Incomparability is retained; neither offer is silently chosen as the winner.
Changed condition and stop. If B’s quality is unknown, OfferCG@1’s evidence condition fails: CompareEligibility returns abstain, no Compare result is fabricated, and the selector has no complete comparison basis. Its guard returns abstain, with no Select application or selected-set result. Changing only the selected comparator declaration to an unresolved edition also stops at protocol resolution before calculation. A suite-shaped record cannot cure either missing basis.
The description answers which contracts can be jointly used and under what conditions. The four stipulated applications answer what happened in this case. A gate decision, dated Work account or published result would need its own independently established basis.
Declaration-change case. The CHR normalize stage resolves to apply in a selected UNM declaration edition. Let D1 admit pass and policy-supported degrade, as A.19.UNM §4.1 does. Suppose a separately proposed D2 changes the operation guard to pass only. For the same input whose eligibility is degrade, D1 permits the qualified output and D2 does not. Merely pinning both sources or writing UNM + normalize cannot decide which contract governs. A step selecting D1 remains on D1; substituting D2 changes the member contract and requires the new guard to pass. These are illustrative edition names, not claims that both editions are published.
Two different realizers of D1 still use one member. UNM and the independently identified UINDM declaration are different members. A differently formatted publication of D1 can preserve the declaration identity. A new declaration about an independently established same family is still a new contract when its content changes; any family-continuity claim remains separate. Thus the protocol can resolve even where family continuity is irrelevant or unresolved.
Example 2 (non-conformant). Misusing a family as a suite:
CHRMechanismFamily : MechFamilyDescription := { UNM, UINDM, USCM, ... }
This is a level error: MechFamilyDescription is reserved for realizations of a single mechanism declaration.
Example 3 (non-conformant). Conflating suite conditions with decisions, governing rules or relation facts:
- The suite declares
GateDecisionvalues or embeds aDecisionLog. - The suite defines acceptance thresholds (“pass score ≥ 0.7”) as part of suite obligations.
- The suite embeds conversion or penalty tables, invents relation facts from a graph label, or treats referenced transport pins as an applied conversion or gate decision.
Gate decisions remain at the gate; acceptance clauses, task signatures or gate profiles state thresholds; and the applicable specifications, policies and direct predicates govern conversions, penalties and relation facts. A suite states the requirements on their use.
A.6.7:5 - Archetypal Grounding
A suite is an archetypal mechanism-suite “passport”:
- It answers what mechanisms exist in the bundle and what shared invariants make their composition lawful.
- It provides shared governing spec anchors (pins) that downstream planning and work must cite.
- It remains descriptive: it does not contain run-time outputs, and it does not replace the transformation-flow structure selected under E.18 for composition and crossing visibility.
A.6.7:6 - Bias-Annotation
Common biases this pattern guards against:
- Overloading “family”. Treating “many different mechanisms” as “many realizations of one mechanism” destroys level hygiene and encourages semantic drift across members.
- Publication conflation. Using “pack” semantics to include publication/shipping obligations in the meaning of a mechanism bundle.
- Gate conflation. Treating suite-level obligations as gate decisions (“block”) instead of keeping
blockat the gate layer. - Convenience totalization. Collapsing partial orders into scalars “for ease of selection”, which undermines set-return semantics and admissibility gating.
A.6.7:7 - Conformance Checklist
A MechSuiteDescription is conformant iff all applicable items hold:
CC‑A.6.7‑1 (Correct level). The suite’s mechanisms enumerate distinct U.Mechanism members. The suite is not encoded as MechFamilyDescription.
CC‑A.6.7‑2 (Description token, not U.*). The suite token is a Description token and MUST NOT be introduced under U.*. Its name ends with …Description.
CC‑A.6.7‑3 (No execution semantics). The suite MUST NOT define mechanism blocks (OperationAlgebra, LawSet, etc.) and MUST NOT be used as a mechanism node.
CC‑A.6.7‑4 (No gate decisions). The suite MUST NOT define GateDecision, MUST NOT publish DecisionLog, and MUST preserve gate/mechanism separation.
CC‑A.6.7‑5 (Spec pins, not duplication). If the suite is admissibility-gated for numeric comparison/aggregation/scoring, it MUST require CG-Spec citation pins (and SHOULD require CN-Spec pins where applicable). It MUST NOT duplicate spec content as “local CG-Spec”.
CC‑A.6.7‑5a (CN+CG pins for admissibility-gated characterization). If the suite is admissibility-gated for characterization, it MUST require both CNSpecRef and CGSpecRef as pins (references), consistent with A.6.7:4.3.
CC‑A.6.7‑6 (Transport discipline preserved). The suite MUST NOT introduce transport exceptions. For an actual semantic crossing, it MUST require the obtaining Bridge and bounded-use grounds under the direct rule, with loss assessed for that receiving use and any numerical assurance penalty satisfying §4.2(2). Entity, scheme, plane or notation changes alone establish no Bridge.
CC‑A.6.7‑7 (Tri-state guard discipline when used). If the suite declares admissibility/eligibility semantics, it MUST use GuardDecision := {pass|degrade|abstain} and MUST NOT coerce unknown to pass.
CC‑A.6.7‑8 (No thresholds in core). The suite MUST NOT publish acceptance thresholds or “passing scores”. Thresholds must remain in acceptance clauses / task signatures / gate profiles.
CC‑A.6.7‑9 (Crossing visibility anchors). If suite use consumes an actual semantic crossing or an independently governed E.18 crossing/A.21 gate, require only that claim’s applicable visibility and audit anchors, including Bridge, CL, policy, UTS or Path pins when its direct rule requires them. A changed edition alone creates none of those objects; keep the changed edition pin without manufacturing a crossing.
CC‑A.6.7‑10 (Suite id present). The suite MUST declare mech_suite_id: MechSuiteId so that downstream planning/audit can cite it stably.
CC‑A.6.7‑11 (Independent correspondence conditions). A claimed kind correspondence MUST satisfy C.3.3 and retain the calibration and use conditions required there. When the use also relies on an F.9 semantic correspondence, establish that Bridge independently and retain both channels’ applicable policies and penalties. A new EntityOfConcern of the same kind or a plane-only change creates neither correspondence by itself.
CC‑A.6.7‑12 (Implementation export hygiene when cited). If the suite cites realizations/implementations, the citations MUST preserve export/import discipline (LOG/CHR: no Γ export; CAL: exactly one Γ; imports acyclic).
CC‑A.6.7‑13 (No Pack conflation). The suite MUST NOT be introduced, named, or used as a publication/shipping Pack.
CC‑A.6.7‑14 (Protocol closure & explicitness). Each step resolves to one member declaration edition and one operation designator in that declaration (WF‑MS‑2). The operation’s argument, result, law and admission meanings are recoverable. No unresolved edition choice, implicit operation or implicit crossing can supply that resolution.
CC‑A.6.7‑15 (P2W split preserved when applicable). If the suite requires a planned-baseline pin, that baseline MUST be content of an A.15.2 U.WorkPlan. Preserve its intended values and references. Actual launch values require independently established facts under E.18:5.6; any FinalizeLaunchValues witness remains a separate episteme.
A.6.7:8 - Common Anti-Patterns and How to Avoid Them
-
Anti-pattern: “Family-as-suite”. Using
MechFamilyDescriptionto list multiple distinct mechanisms. Fix: useMechSuiteDescriptionfor “many mechanisms”, and keepMechFamilyDescriptionfor “many realizations of one mechanism”. -
Anti-pattern: “Pack-as-suite”. Naming/using the suite as a
Pack. Fix: reservePackfor publication/shipping bundling; useSuitefor mechanism bundles. -
Anti-pattern: “Suite contains admissibility tables”. Duplicating CG‑Spec or embedding CL/Φ/Ψ tables in suite obligations. Fix: publish pins and references only; keep admissibility content in
...Specand policy registries; keep crossing realization in E.18/gate surfaces. -
Anti-pattern: “Suite is a hidden gate”. Introducing thresholds,
block, orDecisionLogin the suite. Fix: suite declares guard formats and required pins; the gate issues decisions. -
Anti-pattern: “Implicit calls”. A protocol implies “normalize happens somewhere” without explicit member and pin visibility. Fix: identify the selected member operations and required pins. When an E.18 flow structure is independently selected, keep its Uses edges explicit too.
A.6.7:9 - Consequences
Benefits.
- Eliminates level confusion between “family of realizations” vs “bundle of mechanisms”.
- Lets several protocols reuse one identified set of shared conditions.
- Makes admissibility/transport/audit obligations shared and explicit, reducing semantic drift across member mechanisms.
Costs.
- Adds a description that must be maintained when its member contracts or shared conditions change. Publication is needed only when the receiving use requires it.
- Requires discipline: suites must remain descriptive and must not become “meta-mechanisms” or “hidden gates”.
A.6.7:10 - Rationale
Characterization and admissibility-gated selection pipelines are unified by:
- shared governing spec refs (e.g., CN‑Spec / CG‑Spec),
- shared conditions for actual semantic, kind and plane relations, independently governed flow/gate crossings, and loss assessed under the receiving-use rule,
- shared guard semantics (tri-state, no coercion),
- and explicit protocol constraints (allowed pipelines).
A suite descriptor keeps distinct contracts and their joint conditions explicit. Shared conditions alone establish neither one A.6.1 operation-family declaration nor realizations of one contract; assess any separately proposed mechanism declaration under A.6.1.
A.6.7:11 - SoTA-Echoing
Question and selected answer. How can a practitioner reuse several operation contracts under one set of conditions without selecting an implementation prematurely? For this question, adapt the explicit process-reference, input/output and requirement separation in CWL Workflow v1.2.1, §3.3 and §4.3. Its abstract Operation describes inputs and outputs before binding a concrete process. This supplies a declaration-first composition comparison; FPF admissibility and operation identity retain their own rules.
Serious alternative. A pinned executable pipeline is preferable when the task is already to fit and run compatible estimators. scikit-learn 1.9.1 Pipeline, steps exposes named estimator steps; each has fit, and intermediate steps have transform. It is a composition alternative.
For OfferChoice, compare both approaches with the same two contracts, four operation uses and four specification references. Adopt explicit member/operation resolution and one common specification baseline; reject the shortcut of identifying these contracts only by stage names or selected realizers. An executable pipeline could carry the same facts through adapters and metadata, but those additions still need their declarations and checks. The suite keeps them inspectable before an implementation exists. The deliberate cost is another reference layer; it offers no execution or performance advantage. Once executable estimators and their composition fully answer the question, use that pipeline and do not add a suite merely for documentation.
This choice is expressed in §4.1’s declaration/edition resolution, §4.4’s separate protocol and the filled §4.6 case: a returned comparison binding supplies selection, and absent evidence stops the chain. The architectural comparison is a local inference from the stated use and these primary specifications, not a measured productivity result. Reopen it if a receiving use needs only one already complete executable pipeline, if an additional reference layer hides a required condition, or if a rival represents the same distinct contracts and joint conditions with less total reader work.
A.6.7:12 - Relations
- Relates to A.6.1: suite members are
U.Mechanism; the suite does not replace the mechanism definition. - Relates to A.6.5: member operation declarations retain A.6.1 argument/result meanings, ValueKinds and binding rules. A.6.5 applies only where a cited
RelationSignatureindependently declares participant SlotSpecs; there SlotKind stability, correct refMode and non-semantic SlotIndex remain required. - Relates to E.18 / P2W: suite protocols describe intended composition; use E.18 for the selected transformation-flow structure and its crossings, and E.18.1 for P2W carry-through.
- Suite conformance: use §7 for the applicable requirements. Resolve required references and check the content and facts those requirements consume; a pin’s presence alone does not establish conformance.
- Relates to G.10: suites are not packs; G.10 handles shipping of Part-G outputs as a SoTA pack, while E.17 publishes reader-facing forms of an already accepted engineering account.