Application of Dijkstra's weakest precondition calculus to Dining Philosophers problem

Authors:
Jayasri Banerjee;Anup Kumar Bandyopadhyay;Ajit Kumar Mandal
Affiliations:
Jadavpur University, Kolkata, India;Jadavpur University, Kolkata, India;Jadavpur University, Kolkata, India
Venue:
ACM SIGSOFT Software Engineering Notes
Year:
2007

Citing 6
Cited 3

A Theory of Communicating Sequential Processes

Journal of the ACM (JACM)
Communicating sequential processes

Communicating sequential processes
On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification

Journal of Systems Architecture: the EUROMICRO Journal
Distributed Algorithms

Distributed Algorithms
Hierarchical Compression for Model-Checking CSP or How to Check 1020 Dining Philosophers for Deadlock

TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Ordering of events in two-process concurrent system

ACM SIGSOFT Software Engineering Notes

Fairness and conspiracy concepts in concurrent systems

ACM SIGSOFT Software Engineering Notes
Application of TLRO to dining philosophers problem

ACM SIGSOFT Software Engineering Notes
Application of TLRO to refute an incorrect mutual exclusion algorithm

ACM SIGSOFT Software Engineering Notes

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dijkstra's weakest precondition calculus is used to model the well known Dining Philosophers problem. Process and state definitions are done in such a manner that only the deadlock property of the system is highlighted. Care has been taken to choose the proper details such that it is not too elaborate to obscure the requirements also not be too abstract to mask the actual analytical needs. State transition rules specify the system behavior. Intuitive reasoning as well as formal technique has been applied to get the deadlock condition. Two well known solutions are specified and proved. The proof technique being analytical, its complexity does not depend on the size of the problem. The second solution requires an event ordering and therefore a temporal ordering predicate has been used to prove its correctness.