In this paper we use the timed modal logic $L_\nu$ to specify control objectives for timed plants. We show that the control problem for a large class of objectives can be reduced to a model-checking problem for an extension ($L^c$) of the logic Lnu with a new modality. More precisely we define a fragment of $L_\nu$, namely $L_\nu^d$, such that any control objective of $L_\nu^d$ can be translated into a $L^c$ formula that holds for the plant if and only if there is a controller that can enforce the control objective. We also show that the new modality of $L^c$ strictly increases the expressive power of $L_\nu$ while model-checking of Lc remains EXPTIME-complete.