A notion of bounded bisimilarity is introduced for discrete-time piecewise linear systems. Bounded bisimilarity is the same as the usual bisimilarity except that only trajectories of finite length are considered. We can always find a finite set of equvalence classes for bounded bisimilarity. Using bounded bisimilarity, we propose a method for computing control inputs that achieve a state trajectory satisfing given temporal logic formula and also a desirable level for a given objective function.