Deadlocks remain one of the biggest threats to concurrent programming. Usually, the best programmers can expect is dynamic deadlock detection, which is only a palliative. Object-oriented programs, with their rich reference structure and the resulting presence of aliasing, raise additional problems. The technique developed in this paper relies on the “alias calculus” to offer a completely static...

This paper presents an introduction to an approach for modelling, implementing and reasoning upon systems, based on principles of concurrent object-orientation, generative communication and Petri nets. The approach is illustrated through a case study, proposed by C. Sibertin-Blanc. The case is a variant of the well known dining philosophers problem, called \the Hurried Philosophers" problem.