In: Lecture Notes in Computer Science, Vol. 499; Ada: The Choice for'92, Ada-Europe International Conference, Athens, GR, May 13-17, 1991, pages 125-146. Berlin; Heidelberg; New York: Springer-Verlag, 1991.
Abstract: This paper presents a static analysis method based on extended Petri nets to detect tasking deadlocks and livelocks in a class of concurrent Ada programs. We model the tasking behavior of concurrent Ada programs using extended Petri nets and analyze the Petri net model of an Ada program using an algebraic method. We show that detection of a tasking deadlock or livelock in a concurrent Ada program can be reduced to getting a positive integer solution for a matrix equation concerning the Petri net model of the program. The method is effective for those concurrent Ada programs that include no dynamic creation of tasks, no abort statement, and no exception handler