In this paper, various techniques for random generation of stable polynomials in discrete and continuous time are considered and presented in a unified framework. An 2 attempt is made to present our «global vision» of the potentials of random generation techniques for stable polynomials. Moreover, their properties are discussed and compared, with a particular attention to the Matlab implementation issues. Possible applications are indicated and illustrative results of simulations are provided.