In this paper we discuss a special case of stochastic processes, namely counting processes. In particular, we describe a discrete-time counting process (Binomial) and a continuous-time one (Poisson). We present the main theoretical characteristics and properties, algorithms for computer simulations of such processes and some interesting applications.