It is known that when we apply a linear multistep method to differential-algebraic equations (DAEs), usually the strict stability of the second characteristic polynomial is required for the zero stability. In this paper, we revisit the use of linear multistep discretizations for a class of structured strangeness-free DAEs. Both explicit and implicit linear multistep schemes can be used as underlying methods. When being applied to an appropriately reformulated form of the DAEs, the methods have the same convergent order and the same stability property as applied to ordinary differential equations (ODEs). In addition, the strict stability of the second characteristic polynomial is no longer required. In particular, for a class of semi-linear DAEs, if the underlying linear multistep method is explicit, then the computational cost may be significantly reduced. Numerical experiments are given to confirm the advantages of the new discretization schemes.