Thesis
Deadlock and deadlock freedom
- Abstract:
-
We introduce a number of techniques for establishing the deadlock freedom of concurrent systems. Our methods are based on the local analysis (or at worst a directed global analysis) of networks. We identify the relationships between these techniques and the range of their application within a framework of deadlock freedom types that we have defined. We also show that the problem of proving total correctness may be translated to one of proving deadlock freedom, with the consequence that our techniques for proving deadlock freedom may be utilised to effect a total correctness proof.
- Peer review status:
- Peer reviewed
Actions
Authors
- DOI:
- Type of award:
- DPhil
- Level of award:
- Doctoral
- Awarding institution:
- University of Oxford
- UUID:
-
uuid:458852c5-fa20-41f4-8537-8085a063c546
- Local pid:
-
polonsky:4:12
- Source identifiers:
-
603832150
- Deposit date:
-
2017-10-05
Terms of use
- Copyright holder:
- Dathi, N; Dathi, Naiem
- Copyright date:
- 1989
- Notes:
- This thesis was digitised thanks to the generosity of Dr Leonard Polonsky
If you are the owner of this record, you can report an update to it here: Report update to this record