B.5.MR:11 - SoTA-Echoing
Specification theory compares models that satisfy stated sentences. It supports comparison across signatures when an interpretation specifies how a later model yields an earlier one. Under ordinary set inclusion, an empty class is included in every class. If the task is to show that a specification is infeasible, emptiness can settle it. A practitioner relying on a refined model to select a feasible design or action also needs a surviving completion. Section 4.2 therefore tests existence and preservation and asks which earlier possibility is lost when strictness matters. If the receiving inquiry changes what counts as the same answer, reconsider the interpretation and the comparison under it. This is a historical formal basis for the comparison. Sannella and Tarlecki, Specifications in an Arbitrary Institution, §§2 and 8
Probabilistic program development also uses refinement and abstraction as converse directions while retaining probability-sensitive guarantees. A comparison of outcome sets alone loses that information; section 4.1 therefore keeps the probability claims relevant to the inquiry. The formal construction is a historical anchor, not a claim that every Method is a probabilistic program. Morgan, The Generalised Substitution Language extended to probabilistic programs, §2