In: IEEE Transactions on Software Engineering, Vol. 15, No. 3, pages 314-326. March 1989.
Abstract: This paper presents a method for detecting deadlocks in Ada tasking programs using structural and dynamic analysis of Petri nets. Algorithmic translation of the Ada programs into Petri nets that preserve control flow and message flow properties is described. Properties of these Petri nets are discussed, and algorithms are given to analyze the nets to obtain information about static deadlocks that can occur in the original programs.