After constructing the state diagram Does it solve the mutua

After constructing the state diagram:

Does it solve the mutual exclusion problem?

Consider the following algorithm for solving the MEP problem seen in class: global Boolean wantP, wantQ = false; thread P: {while (true) {//non-critical section wantP = true; await !wantQ;//critical section wantP = false;//non-critical section}} thread Q: {while (true) {//non-critical section wantQ = true; await !wantP;//critical section wantQ = false;//non-critical section}} bullet Construct the state diagram for this algorithm (by first removing all lines with comments).

Solution

A solution to the mutual exclusion problem must satisfy three conditions: