How do I prove whether or not a dining philosophers suffers from deadlock or starvation possibilitie

Posted by Marvin Tenegard on Stack Overflow See other posts from Stack Overflow or by Marvin Tenegard
Published on 2010-03-14T17:54:19Z Indexed on 2010/03/14 17:55 UTC
Read the original article Hit count: 381

Hi,

I have a homework task to prove whether or not a particular variation on the dining philosophers problem suffers from deadlock or starvation. I suspect that the situation does not suffer at all from either but I'm finding this tricky to prove and I don't really know where to start. Is there a general strategy for attacking this sort of problem?

© Stack Overflow or respective owner

Related posts about homework

Related posts about concurrency