In: Proceedings of the 10th International Conference on Distributed Computing Systems, 1990, Paris, France, pages 96-103. Los Alamitos, CA, USA: IEEE Comput. Soc. Press, 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: petri net reduction (for) ada-tasking deadlock detection; reachability analysis; Ada-tasking semantics.