To solve this problem, one needs supports from the running environment like semaphore, timer, fork, multiprocessing, and concurrency. C-Kermit does not provide all that, but you can create them and solve the Dinning Philosophers problem in C-Kermit.

The whole thing is easier to do in OOP fashion where each philosopher is presented by an object. These objects line up in a queue executed in turn by a process object. Each philosopher object carries with itself a softtimer that is timed when the object gets processed.

The philosopher objects compete for chopsticks which are binary semaphore objects. The semaphores keep tracks of the philosophers waiting for chopsticks to be available. Whenever the chopsticks are released by eating philosopher objects, the semaphores send the waiting philosopher objects to the process object queue.

This model of processing are applicable to a variety of complex programming task where resources are competed, state of running objects continously change. And since C-Kermit can communicate with other computers, many useful administration tasks and communication applications can be done comfortably.

For the solution of the Dinning Philosophers problem in C-Kermit, see: