OBJ algebraic specification languages support automated equational reasoning based on term rewriting systems (TRSs) for specification verification. Termination is one of the most important properties of TRSs. Terminating TRSs guarantee that any equational reasoning terminates in finite times. Although termination is an undecidable property, several sufficient conditions have been proposed, and several termination provers have been developed. In this study, we focus on a way to describe terminating algebraic specifications, that is, the coresponding TRSs are terminating. Existing termination provers may inform us whether a given specification is terminating or not. However, they do not give a guideline to describe terminating specifications. We propose a model-based method for describing terminating specifications. In our method, a model of a given specification can be used for proving its termination. Since specifiers are describing a specification while thinking its model in their mind, our model-based termination methods are suitable for algebraic specifications.