Write a rendezvous version of the starvation-free dining philosophers.
<P>

<HR><P>

Write a rendezvous version of the sleeping barber for an arbitrary number
of barbers.
<P>

<HR><P>

Write a rendezvous version of the starvation-free
database readers and writers.
<P>

<HR><P>

Look up in an operating systems textbook
how the Banker's Algorithm for deadlock avoidance works.
Write an SR program that simulates this algorithm
for a collection of processes.
Use the rendezvous, SR's `in' statement,
for process synchronization.
<P>

<HR><P>

Animate one of the programs you wrote above.
<P>