Absorbing Markov Chain

Aiming the analytical modeling of Age of Information (AoI) and Peak-AoI, uploaded codes construct and solve analytical models for Non-preemptive Bufferless, Probabilistic Generate-at-will (GAW) and Random Arrival with Single Buffer (RA-SB) servers using the theory of absorbing Markov Chains. In particular, they output per-source PAoI/AoI distributions in a setting with general number of sources where the sources may have different (i) general phase-type service time distributions, (ii) packet error probabilities and (iii) arrival rates.