Polynomial verification for safe codiagnosability of decentralized fuzzy discrete-event systems

Since fuzzy discrete-event systems (FDESs) modeled by fuzzy automata were put forward, extensive research on FDESs has been successfully conducted from different perspectives. Recently, the safe codiagnosability of decentralized FDESs was introduced and an approach of constructing the safe codiagnos...

Full description

Saved in:
Bibliographic Details
Published in:Fuzzy sets and systems Vol. 490; p. 109041
Main Authors: Liu, Fuchun, Cao, Weihua, Dziong, Zbigniew
Format: Journal Article
Language:English
Published: Elsevier B.V 15.08.2024
Subjects:
ISSN:0165-0114, 1872-6801
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Since fuzzy discrete-event systems (FDESs) modeled by fuzzy automata were put forward, extensive research on FDESs has been successfully conducted from different perspectives. Recently, the safe codiagnosability of decentralized FDESs was introduced and an approach of constructing the safe codiagnoser to verify the safe codiagnosability was proposed. However, the complexity of constructing the safe codiagnoser of decentralized FDESs is exponential. In this paper, we present a polynomial verification. Firstly, the recognizer and the safe coverifier are constructed to recognize the prohibited strings in the illegal language and carry out safe diagnosis of decentralized FDESs, respectively. Then the necessary and sufficient condition for safe codiagnosability of decentralized FDESs is presented. In particular, an algorithm for verifying the safe codiagnosability of decentralized FDESs is proposed based on the safe coverifier. Notably, both complexities of constructing the safe coverifier and verifying the safe codiagnosability are polynomial in the numbers of fuzzy events and fuzzy states of FDESs. Finally, two examples are provided to illustrate the proposed algorithm and the derived results.
ISSN:0165-0114
1872-6801
DOI:10.1016/j.fss.2024.109041