Abstract. The logic LTL ▽ extends LTL by quality operators. The satisfaction value of an LTL ▽ formula in a computation refines the 0/1 value of LTL formulas to a real value in [0, 1]. The higher the value is, the better is the quality of the computation. The quality operator ▽λ, for a quality constant λ ∈ [0, 1], enables the designer to prioritize different satisfaction possibilities. Formally, the satisfaction value of a subformula ▽λϕ is λ times the satisfaction value of ϕ. For example, the LTL ▽ formula G(req → (Xgrant ∨ ▽ 1 F grant)) has value 1 in computations in which every 2 request is immediately followed by a grant, value 1 if grants to some requests involve 2 a delay, and value 0 if some request is not followed by a grant. The design of an LTL ▽ formula typically starts with an LTL formula on top of which the designer adds the parameterized ▽ operators. In the Boolean setting, the problem of automatic generation of specifications from binary-tagged computations is of great