Improved verifying algorithm for mathematical model of deadlocks

In article the algorithm of deadlocks searching in software expressed by its model is considered. The concept of deadlocks model based on graph theory considering concepts of the subject (thread), the shared object and the synchronization primitive is introduced. The verifying algorithm conclusing in transformation of linear system of subjects to oriented graphs which nodes are operators of interaction with synchronization primitives is given, and edges correspond to relationships between these operators. The proof of theorems confirming operability of offered algorithm is provided.