PM-STA-0050

An implementation MUST derive, for each State, the States an object must previously have held — separately for the object acting as Subject and as Object of a proposition. These prerequisites MUST be inferred from the model rather than authored directly.

Non-normative. pciml:hasPrerequisiteSubject and pciml:hasPrerequisiteObject are inferred properties, so the ordering is a consequence of the Filter-Operation-State graph rather than a second thing to keep in sync. The description says they exist to enable simulation of the Finite-State Machine.

This is the most promising material yet found for repairing PM-STR-0030. A prerequisite relation is a partial order over the States of a Thing, and a partial order is exactly what a tie-break rule needs: where several Restrictions hold, prefer the maximal State under the prerequisite order. Whether that is what Guil intended is Q-G-0001 and now also Q-G-0032; whether it is well-founded on every model is a proof obligation, not an assumption, because nothing yet shown forbids a cycle.

---