Reliable fault prediction of decentralized stochastic discrete‐event systems under dynamic observations

Abstract Most studies on fault prediction of decentralized discrete‐event systems (DESs) are based on the assumptions that the observability of events remains constant and any local information is never lost. Nevertheless, in numerous practical applications, the observability of events is closely associated with the changing states of systems, and some information may not be available in time. In this paper, the reliable fault prediction issue for decentralized stochastic DESs (SDESs) under dynamic observations is investigated in the face of the changing observability of events and the potential unavailability of some local information. The main contributions are as follows. First, the notion of ‐reliable ‐step stochastic copredictability (or ‐copredictability) of SDESs is formalized, in which an SDES with ‐copredictability distributed at local sites is required that all faults can be predicted in the sense of probability at least steps in advance under dynamic observations, even if local sites are invalid. Second, an automaton named reliable ‐coverifier is formally constructed, and a necessary and sufficient condition for testing the ‐copredictability is presented based on the constructive reliable ‐coverifier. Finally, a polynomial‐time algorithm is proposed to verify the ‐copredictability of SDESs under dynamic observations.

Authors

Institutions

Publication Details

Journal
Asian Journal of Control
Published
2026-06-17
DOI
https://doi.org/10.1002/asjc.70170
Primary Topic
Petri Nets in System Modeling
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reliable fault prediction of decentralized stochastic discrete‐event systems under dynamic observations

Jianqi Liu, Fuchun Liu, Zehao Chen
Asian Journal of Control
Petri Nets in System Modeling
article

Reliable fault prediction of decentralized stochastic discrete‐event systems under dynamic observations

Jianqi Liu, Fuchun Liu, Zehao Chen
article en

Abstract

Abstract Most studies on fault prediction of decentralized discrete‐event systems (DESs) are based on the assumptions that the observability of events remains constant and any local information is never lost. Nevertheless, in numerous practical applications, the observability of events is closely associated with the changing states of systems, and some information may not be available in time. In this paper, the reliable fault prediction issue for decentralized stochastic DESs (SDESs) under dynamic observations is investigated in the face of the changing observability of events and the potential unavailability of some local information. The main contributions are as follows. First, the notion of ‐reliable ‐step stochastic copredictability (or ‐copredictability) of SDESs is formalized, in which an SDES with ‐copredictability distributed at local sites is required that all faults can be predicted in the sense of probability at least steps in advance under dynamic observations, even if local sites are invalid. Second, an automaton named reliable ‐coverifier is formally constructed, and a necessary and sufficient condition for testing the ‐copredictability is presented based on the constructive reliable ‐coverifier. Finally, a polynomial‐time algorithm is proposed to verify the ‐copredictability of SDESs under dynamic observations.

Asian Journal of Control
Guangdong University of Technology (CN)
Basic and Applied Basic Research Foundation of Guangdong Province
Openalex Percentile: Top 6%
Petri Nets in System Modeling
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.