Abstract

This paper proposes an approach for diagnosability analysis and enforcement of λ-free Petri nets. First, a verifier net is constructed based on the system model and its fault-free subnet. Then, the reachability graph of the verifier net is constructed, and a necessary and sufficient condition is established to determine whether the system is diagnosable. If the system is not diagnosable, a diagnosability enforcement strategy is further proposed. Specifically, we present a systematic procedure to construct a new labeling function that ensures the diagnosability of the system while minimizing cost. The construction follows a set of labeling rules, and an integer linear programming model is employed to obtain the optimal labeling scheme.