> What are all the classes of possible deadlocks?

The first one I thought of was the Dining Philosopher's problem.
Google showed me
ttp://www.erights.org/e/satan/index.html

This is an interesting article.  It uses capabilities to ensure
freedom from deadlock.  If a philosopher has a fork for two long, the
system will revoke his capability for the fork.

If E was automatically free from deadlock, why was this solution so complex?

-Ralph