1. The problem statement, all variables and given/known data I have a question about theory of multi-processes competing for resources. Basically, I want to know a semi-formal way to prove liveness, which informally it means that "something good must eventually happen". For example, some process may eventually enter a critical section. 2. Relevant equations I want to know how to prove this. Can I show that there are no deadlocks or livelocks? Or show that there are livelocks and deadlocks present and in this way prove that liveness is not present in an algorithm? 3. The attempt at a solution Thank you.