Reliable predictability of patterns in decentralized discrete-event systems.

Copredictability Decentralized fault prediction Discrete-event systems (DESs) Pattern matching Reliable copredictability

Journal

ISA transactions
ISSN: 1879-2022
Titre abrégé: ISA Trans
Pays: United States
ID NLM: 0374750

Informations de publication

Date de publication:
Apr 2022
Historique:
received: 13 04 2020
revised: 14 05 2021
accepted: 15 05 2021
pubmed: 31 5 2021
medline: 31 5 2021
entrez: 30 5 2021
Statut: ppublish

Résumé

Predictability is an important property which is used to predict the failures which is not observable for the sensors straightly before they occur. In an automation system, in addition to the failure caused by a single event, there also exist pattern failures caused by event strings composed of multiple events. In order to prevent some local sites malfunction, the issue of reliable predictability of patterns is considered in this paper, where the prediction information may be distributed at physically separated sites. Our contributions are listed mainly as follows: Firstly, the k-reliable pattern copredictability in decentralized DESs is defined with formal languages. Generally speaking, for a decentralized system where there are r local sites, it is said to be k-reliably pattern copredictable (1≤k≤r) if there are at least r-k+1 local agents which can predict every occurrences of the pattern failure for every pattern failure, it indicates that the prognostication capability will be maintained while r-k local sites in malfunction state. Then two nondeterministic automata respectively named codiagnoser and coverifier from the given system are constructed in this paper, and two algorithms of verifying the reliable copredictability of pattern are presented by constructing the codiagnoser and coverifier respectively for the purpose of attain the capability of prognostication. Especially, two necessary and sufficient conditions under the codiagnoser and coverifier are proposed. Moreover, for the decentralized DESs, the verification algorithm related to the k-reliable pattern copredictability is proposed after presenting the necessary and sufficient conditions for reliable pattern copredictability. It is worth noting that a polynomial complexity algorithm is used in constructing the coverifier and verifying the k-reliable pattern copredictability.

Identifiants

pubmed: 34052012
pii: S0019-0578(21)00277-9
doi: 10.1016/j.isatra.2021.05.022
pii:
doi:

Types de publication

Journal Article

Langues

eng

Sous-ensembles de citation

IM

Pagination

230-239

Informations de copyright

Copyright © 2021 ISA. Published by Elsevier Ltd. All rights reserved.

Déclaration de conflit d'intérêts

Declaration of Competing Interest The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

Auteurs

Hongzhen Zhu (H)

School of Computers, Guangdong University of Technology, Guangzhou, 510006, China.

Fuchun Liu (F)

School of Computers, Guangdong University of Technology, Guangzhou, 510006, China. Electronic address: fliu2011@163.com.

Rui Zhao (R)

School of Computers, Guangdong University of Technology, Guangzhou, 510006, China.

Classifications MeSH