We consider the drink vendor machine example (see transition system T below) and the specification "one can only get finitely many drinks".

- Formalize the specification as an LTL formula
- Give a Büchi automaton B that accepts the runs that do not satisfy the formula
- Compute the product P of the Büchi automaton B and the transition system T
- Check if the transition system T satisfies the property above using:
- A naive algorithm based on DFS requests on P
- A decomposition of P in strongly-connected components

- Write a PlusCal model corresponding to the transition system above and model-check your model w.r.t. the specification above