There are many applications of Probability Generating Functions (PGFs), however, one natural example occurs in the study of discrete time Markov Chains and Stochastic Processes.
Let us start with the setup:
A Branching Process is the sequences $(X_n)_{n \in \mathbb{N}} \in \mathbb{N}_0$ where $X_n$ denotes the number of individuals in a population at time $n$. Each individual $i$ in this process gives birth to a ($Z_i^n$) offspring (independently and identically distributed) at time $n$ which forms the next generation at the time $n+1$. Therefore, $X_{n+1}= \sum_{i=1}^{n}Z_i^n$.
Some quick observations we make here is firstly that $(X_n)$ is a Markov Chain and that once the chain is at $0$, it will stay at $0$ forever. Therefore, this is useful as a simple modelling technique for population growth. We don't impose a constraint on the offspring distribution $Z_i^n$ other than them being independent and identically distributed.
Now we can turn to our application of PGFs.
The Extinction Probability is the smallest non-negative root of the equation $\alpha = G(\alpha)$ where G is the PGF of our offspring distribution
Therefore, by solving this relatively simple equation above, we can determine the probability that the population will die out under our Branching Process model.
The Extinction Mean Criterion tells us that for when our PGF $G(0)>0$, then:
$\mathbb{E}(Z_i^n) \leq 1 \space \implies \space$ Certain Extinction
$\mathbb{E}(Z_i^n) > 1 \space \implies \space$ Uncertain Extinction
And so as we can see, the PGF does turn out to be quite a useful tool here - helping with this class of population models.
As an additional comment, Branching Processes may seem like one of many population modelling choices available - however, many of the most common modelling techniques can fall under the heading of a Branching Process including SIR modelling, SIS modelling, and (with a specific choice $\gamma$ of the recovery rate), the Reed-Frost model too.