triz_weakness
Rank candidate concepts by the operating situations they admit: compare set inclusion to find which admits every situation others admit, with optional priors for weighted ranking.
Instructions
Rank candidate concepts that declare behaviour by the operating situations they admit (references/weakness.md). A situation is a valuation of the concepts' boundary inputs (unwired input ports, matched by box and port id) over their carriers' declared values: the declared input space is weakness.md's list of operating situations. A concept admits a situation when it has a steady state there and every deliverable output there is acceptable (acceptable: per deliverable port, or per carrier for all its deliverables, the values that are, listed or derived from a threshold at_least/below that is a declared level of the carrier; required for every deliverable; derived sets are listed under acceptable in the result). Give each operating condition the same box and port id in every concept (e.g. an environment box with an unwired input); readByOne lists the inputs only one concept reads. Ranked by set inclusion: weakest (admits everything any other admits), maximal, and every pair as equal, first-weaker, second-weaker, or incomparable, with a situation only one admits each way. The admitted count is a secondary figure: it depends on how finely carrier values are declared. priors gives a real prior over the situations (weakness.md: a real prior beats the uniform assumption): per situation input (box and port), or per carrier, a nonnegative weight per declared value (unlisted inputs and values count 1; 0 rules a value out); each concept carries the total prior mass of what it admits (weightedAdmitted, ranked in byWeight), and no inclusion ever moves under weights. joint_prior is the alternative for correlated operating conditions: an explicit complete joint table, a weight for every situation (zero allowed), with no independence assumption; it reports jointAdmittedWeight and jointAdmittedProbability per concept, ranked in byJointPrior, separately from inclusion and counts. Give priors or joint_prior, not both. Fails closed when the concepts deliver different ports, an input several read ranges over different values, or acceptable misses a deliverable or names an undeclared value, or a prior is malformed; undecided on missing behaviour or past the state cap. Filter concepts for adequacy first; for safety, integrity, or authorisation decisions admitting more is the wrong direction.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| scope | No | ||
| priors | No | A prior over the operating situations (weakness.md: a real prior beats the uniform assumption): per situation input (box and port), or per carrier, the weight of each declared value. weightedAdmitted is each concept's total admitted mass and byWeight ranks by it; the inclusion ranking and the pairs never change | |
| concepts | Yes | Candidate concepts, each a model that declares behaviour for every box that can reach a deliverable | |
| acceptable | Yes | Per deliverable port (a product input port), or per carrier for every deliverable it carries, the acceptable values: listed, or derived from a threshold (at_least, below) through the carrier's levels. An output is acceptable when every deliverable's value is | |
| max_states | No | Cap on situations and search states per concept (default and maximum 100000) | |
| joint_prior | No | Instead of priors, for correlated conditions: explicit joint mass for EVERY complete situation, including zero mass; no independent-input assumption. jointAdmittedWeight and jointAdmittedProbability per concept, ranked in byJointPrior | |
| lifecycle_priors | No | Opt-in concept-specific priors from each model lifecycle occupancy; each state needs a complete situation mapping |