A priority dynamics for generalized drinking philosophers

We consider a generalization of the drinking philosophers problem, called GDrPP, in which processes may issue AND-OR requests for resources, as opposed to the AND requests of the original formulation. For GDrPP, we introduce a basic priority dynamics that can be regarded as generalizing the edge-reversal priority dynamics underlying the classical solution to the original formulation. The novel priority dynamics is based on new results on the graphs that reflect waits due to AND-OR requests.