Self-Stabilizing Philosophers with Generic Conflicts – Dining Philosophers

Each philosopher has two sets of neighbors- communication neighbors and conflict neighbors. With communication neighbor there is no mutual exclusion, but among conflict neighbors at most one philosopher can exclusive execute the Critical Section. The paper has detailed explanation on how to implement the algorithm.
It would be really helpful if someone can implement the algorithm in JAVA or C .
The paper also describes on implementing this algorithm with wireless networks, but that is optional.