Stochastic Failure Prognosability of Discrete Event Systems
- 18 December 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 60 (6), 1570-1581
- https://doi.org/10.1109/tac.2014.2381437
Abstract
We study the prognosis of fault, i.e., its prediction prior to its occurrence, in stochastic discrete event systems. We introduce the notion of m-steps Stochastic-Prognosability, called S m -Prognosability, which allows the prediction of a fault at least m-steps in advance. We formalize the notion of a prognoser and also show that S m -Prognosability is necessary and sufficient for the existence of a prognoser that can predict a fault at least m-steps prior to occurrence, while achieving any arbitrary false alarm and missed detection rates. We also provide a polynomial algorithm for the verification of S m -Prognosability. Finally, we compare the notion of stochastic prognosability with that of stochastic diagnosability, and show that the former is a stronger notion, as can be expected.Keywords
Funding Information
- National Science Foundation
This publication has 18 references indexed in Scilit:
- Online failure diagnosis of stochastic discrete event systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Decentralized failure diagnosis of stochastic discrete event systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2013
- Predictability of Event Occurrences in Timed SystemsLecture Notes in Computer Science, 2013
- Quantifying OpacityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- A language measure for performance evaluation of discrete-event supervisory control systemsApplied Mathematical Modelling, 2004
- Probabilistic analysis of anonymityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A probabilistic language formalism for stochastic discrete-event systemsIEEE Transactions on Automatic Control, 1999
- CrowdsACM Transactions on Information and System Security, 1998
- Efficient state classification of finite state Markov chainsPublished by Association for Computing Machinery (ACM) ,1998
- Scaling Algorithms for the Shortest Paths ProblemSIAM Journal on Computing, 1995