Active Diagnosis of Petri Nets Using Q-Diagnoser

Abstract

In this paper we study the active diagnosis problem in Petri nets with quiescence. We first generalize the notion of diagnosability to Petri nets that may contain deadlocks. To avoid enumerating the reachability space, we introduce a structure called the Quiescent Basis Reachability Graph, based on which a structure called the Q-diagnoser is computed. Finally, a supervisor is designed based on Q-diagnoser such that the closed-loop system is diagnosable.