Construction of checking tests for complex discrete devices using hierarchical Petri nets

摘要

Procedures for modeling discrete devices in the language of hierarchical Petri nets are considered. A method of generating a checking test based on a maximum criterion for the number of faults that have not been checked by prior tests is proposed. The method is implemented by means of an algorithm that selects test sequences from a set of random input actions; the algorithm itself is represented in the form of base structures of the model.