Title :
Applying Petri net reduction to support Ada-tasking deadlock detection
Author :
Tu, S. ; Shatz, S.M. ; Murata, T.
Author_Institution :
Software Syst. Lab., Illinois Univ., Chicago, IL, USA
fDate :
28 May-1 Jun 1990
Abstract :
The application of Petri net reduction to Ada-tasking deadlock detection is investigated. Net reduction can ease reachability analysis by reducing the size of the net while preserving relevant properties. By combining Petri net theory and knowledge of Ada-tasking semantics some specific efficient reduction rules are derived for Petri net models of Ada-tasking. A method by which a useful description of a detected deadlock state can be easily obtained from the reduced net´s information is suggested
Keywords :
Ada; Petri nets; concurrency control; distributed processing; program verification; Ada-tasking deadlock detection; Ada-tasking semantics; Petri net reduction; Petri net theory; analysis by transformation; model reduction; reachability analysis; reduction rules; Algorithm design and analysis; Displays; FETs; Face detection; Information analysis; Laboratories; Petri nets; Reachability analysis; Software systems; System recovery;
Conference_Titel :
Distributed Computing Systems, 1990. Proceedings., 10th International Conference on
Conference_Location :
Paris
Print_ISBN :
0-8186-2048-X
DOI :
10.1109/ICDCS.1990.89289
