A graph model for deadlock prevention

Vita.A deadlock prevention model is developed. In the process, a relationship between two seemingly unrelated problems and their relevance to deadlock prevention problem is demonstrated. These problems are Dijkstra's n-philosophers synchronization problem and n-queens problem. A program is developed in which the generation of deadlock free paths is possible. Several synchronization models are compared and their relationship to deadlock prevention problem is shown. A graphic representation of task systems model is developed which makes the identification of the relationship between task systems model and vector addition systems more transparent