Affiliation:
1. Jadavpur University, Kolkata, India
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.
Publisher
Association for Computing Machinery (ACM)
Reference8 articles.
1. On the derivation of a correct deadlock free communication kernel for loop connected message passing architecture from its user's specification
2. Jayasri Banerjee Anup Kumar Bandyopadhyay and Ajit Kumar Mandal Ordering of Events in Two-Process Concurrent System to be published in ACM SIGSOFT. 10.1145/1281421.1281423 Jayasri Banerjee Anup Kumar Bandyopadhyay and Ajit Kumar Mandal Ordering of Events in Two-Process Concurrent System to be published in ACM SIGSOFT. 10.1145/1281421.1281423
3. Hierarchical ordering of sequential processes
4. The pursuit of deadlock freedom, Oxford University Computing Laboratory Technical Monograph;Roscoe W.;PRG --,1986
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献