This paper proposes a computational method for the feasibility check and design of discrete abstract models of nonlinear dynamical systems. First, it is shown that a given discre-tetime dynamical system can be transformed into a finite automaton by embedding a quantizer into its state equation. Under this setting, a sufficient condition for approximate bisimulation in infinite steps of time between the concrete model and its discrete abstract model is derived. The condition takes the form of a set of linear inequalities and thus can be checked efficiently by a linear programming solver. Finally, the iterative refinement algorithm, which generates a discrete abstract model under a given error specification, is proposed. The algorithm is guaranteed to terminate in finite iterations.