To prove that an arrival process is Markovian and memory-less, one must demonstrate that it satisfies the definition of a Markov Process, which depends on the specific characteristics of the arrival process. In the context of people arriving at a bus stop, it is suggested to assume the system is Markovian for the application of queueing theory and stochastic processes. The discussion highlights the need for statistical tests to evaluate the hypothesis that the arrival process follows a Poisson distribution, noting that statistical tests do not constitute mathematical proof. Ultimately, clear identification of the arrival data and appropriate statistical methods are crucial for validating the Markovian nature of the process. Understanding these concepts is essential for effectively analyzing arrival patterns in queueing systems.