A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets
Authors:
Top Cited Papers
- 21 May 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 57 (12) , 3104-3117
Abstract
In this paper, we analyze the diagnosability properties of labeled Petri nets. We consider the standard notion of diagnosability of languages, requiring that every occurrence of an unobservable fault event be eventually detected, as well as the stronger notion of diagnosability in K steps, where the detection must occur within a fixed bound of K event occurrences after the fault. We give necessary and sufficient conditions for these two notions of diagnosability for both bounded and unbounded Petri nets and then present an algorithmic technique for testing the conditions based on linear programming. Our approach is novel and based on the analysis of the reachability/coverability graph of a special Petri net, called Verifier Net, that is built from the Petri net model of the given system. In the case of systems that are diagnosable in K steps, we give a procedure to compute the bound K. To the best of our knowledge, this is the first time that necessary and sufficient conditions for diagnosability and diagnosability in K steps of labeled unbounded Petri nets are presented.Keywords
This publication has 38 references indexed in Scilit:
- Discrete event diagnosis using labeled Petri nets. An application to manufacturing systemsControl Engineering Practice, 2011
- Complexity of place/transition nets2006
- Failure Diagnosis of Discrete-Event Systems With Linear-Time Temporal Logic SpecificationsIEEE Transactions on Automatic Control, 2004
- Diagnosis of asynchronous discrete-event systems: a net unfolding approachIEEE Transactions on Automatic Control, 2003
- Polynomial-time verification of diagnosability of partially observed discrete-event systemsIEEE Transactions on Automatic Control, 2002
- Failure diagnosis using discrete-event modelsIEEE Transactions on Control Systems Technology, 1996
- Diagnosability of discrete-event systemsIEEE Transactions on Automatic Control, 1995
- Complexity results for 1-safe netsTheoretical Computer Science, 1995
- Fault detection/monitoring using time Petri netsIEEE Transactions on Systems, Man, and Cybernetics, 1993
- Petri nets and regular languagesJournal of Computer and System Sciences, 1981