How do we find the strongest implementable specifications?

# Ex373

**hehner**#2

There is no guaranteed method for finding the strongest implementable specification. Use recursive construction starting with something strong. You could try ⊥ . In this example, look at Q, and so maybe start with x’=0 ∧ t’≥t. Anyway, the question doesn’t say find the strongest implementable specification. It says find the strongest implementable specification that you can find. If a specification is implementable (at least one possible answer) and deterministic (at most one possible answer), then it is either the strongest implementable specification, or tied for strongest implementable specification.