The Community for Technology Leaders
Green Image
<p>A method is presented for detecting deadlocks in Ada tasking programs using structural; and dynamic analysis of Petri nets. Algorithmic translation of the Ada programs into Petri nets which 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. Petri net invariants are used by the algorithms to reduce the time and space complexities associated with dynamic Petri net analysis (i.e. reachability graph generation).</p>
Ada static deadlocks; Petri net invariants; Ada tasking programs; control-flow; message-flow; complexities; Ada; computational complexity; concurrency control; Petri nets; program testing; system recovery.

S. Shatz, T. Murata and B. Shenker, "Detection of Ada Static Deadlocks Using Petri Net Invariants," in IEEE Transactions on Software Engineering, vol. 15, no. , pp. 314-326, 1989.
92 ms
(Ver 3.3 (11022016))