Reliable Co-Prognosability of Decentralized Stochastic Discrete-Event Systems and a Polynomial-Time Verification

Fault prognosis of discrete-event systems (DESs) aims to predict the occurrence of fault beforehand such that certain protective measures may be adopted before the fault occurs. This article investigates the reliable coprognosability issue for decentralized stochastic DESs (SDESs) facing the possibl...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on cybernetics 2022-07, Vol.PP (7), p.1-10
Main Authors: Liao, Hui, Liu, Fuchun, Zhao, Rui
Format: Article
Language:English
Subjects:
Coprognosability
decentralized fault prognosis
Discrete event systems
discrete-event systems (DESs)
Polynomials
reliable coprognosability
stochastic automata
Stochastic systems
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Fault prognosis of discrete-event systems (DESs) aims to predict the occurrence of fault beforehand such that certain protective measures may be adopted before the fault occurs. This article investigates the reliable coprognosability issue for decentralized stochastic DESs (SDESs) facing the possible unavailability of some local agents. The main contributions are as follows. First, we formalize the notion of r-reliable coprognosability for SDESs. In general, an r-reliably coprognosable SDES with n local sites (1 ≤ r ≤ n ) can predict the occurrences of faults even though n-r local agents are invalid. Second, we construct a reliable coprognoser from the given stochastic system and present a necessary and sufficient condition for testing r-reliable coprognosability by the reliable coprognoser. Third, due to the exponential complexity of testing r-reliable coprognosability by reliable coprognoser, a reliable coverifier is constructed and an alternate necessary and sufficient condition for verifying r-reliable coprognosability of SDESs by the reliable coverifier is proposed, which is polynomial time.
ISSN:2168-2267
2168-2275
DOI:10.1109/TCYB.2021.3051260