Master of Science (MS)
First Committee Member
Ajoy Kumar Datta
Number of Pages
The problem of distributed deadlock detection has undergone extensive study. Formal verification of deadlock detection algorithms in distributed systems is an area of research that has largely been ignored. Instead, most proposed distributed deadlock detection algorithms have used informal or intuitive arguments, simulation or just neglect the entire aspect of verification of correctness; As a consequence, many of these algorithms have been shown incorrect. This research will abstract the notion of deadlock in terms of a temporal logic of actions and discuss the invariant and eventuality properties. The contributions of this research are the development of a distributed deadlock detection algorithm and the formal verification of this algorithm.
Algorithms; Deadlock; Detection; Distributed; Formal; Verification
Computer science; Mathematics
University of Nevada, Las Vegas
If you are the rightful copyright holder of this dissertation or thesis and wish to have the full text removed from Digital Scholarship@UNLV, please submit a request to email@example.com and include clear identification of the work, preferably with URL.
Johnston, Brian Matt, "Formal verification of distributed deadlock detection algorithms" (1993). UNLV Retrospective Theses & Dissertations. 293.