Verification of Prognosability for Labeled Petri Nets
Author:
- 26 September 2017
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 63 (6) , 1828-1834
Abstract
This technical note is concerned with the fault prognosis problem for partially observed discrete-event systems modeled by unbounded labeled Petri nets. The goal of this problem is to predict the occurrence of each fault before its occurrence. The condition of prognosability provides the necessary and sufficient condition under which any fault can be predicted with no missed detection and no false alarm. In this technical note, we investigate the verification of prognosability for unbounded labeled Petri nets. First, we show that checking prognosability is decidable for Petri net languages. Our approach is based on a reduction from this verification problem to an existing Petri nets model checking problem. Then, we show that the complexity of this problem is EXPSPACE-complete. Our results extend previous works on the verification of language-based prognosability from regular languages to Petri net languages.Keywords
This publication has 34 references indexed in Scilit:
- On -diagnosability of Petri nets via integer linear programmingAutomatica, 2012
- Distributed Failure Prognosis of Discrete Event Systems With Bounded-Delay CommunicationsIEEE Transactions on Automatic Control, 2011
- Fault detection for discrete event systems using Petri nets with unobservable transitionsAutomatica, 2010
- On-line fault detection in discrete event systems by Petri nets and integer linear programmingAutomatica, 2009
- Fault Diagnosis in Discrete Event Systems Modeled by Partially Observed Petri NetsDiscrete Event Dynamic Systems, 2009
- Predictability of event occurrences in partially-observed discrete-event systemsAutomatica, 2009
- Diagnosis of asynchronous discrete-event systems: a net unfolding approachIEEE Transactions on Automatic Control, 2003
- A unified approach for deciding the existence of certain petri net pathsInformation and Computation, 1992
- The covering and boundedness problems for vector addition systemsTheoretical Computer Science, 1978
- Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime FactorsAmerican Journal of Mathematics, 1913