Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
Polynomial-Time Verification of Decentralized Fault Pattern Diagnosability for Discrete-Event Systems
by
Liang, Ye
, Liu, Gaiyun
, El-Sherbeeny, Ahmed M.
in
Algorithms
/ Analysis
/ codiagnosability
/ computational complexity
/ decentralized diagnosis
/ discrete event system
/ Discrete event systems
/ Fault diagnosis
/ fault pattern
/ Mathematics
/ Polynomials
/ Robots
/ Verification
2023
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Polynomial-Time Verification of Decentralized Fault Pattern Diagnosability for Discrete-Event Systems
by
Liang, Ye
, Liu, Gaiyun
, El-Sherbeeny, Ahmed M.
in
Algorithms
/ Analysis
/ codiagnosability
/ computational complexity
/ decentralized diagnosis
/ discrete event system
/ Discrete event systems
/ Fault diagnosis
/ fault pattern
/ Mathematics
/ Polynomials
/ Robots
/ Verification
2023
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
Polynomial-Time Verification of Decentralized Fault Pattern Diagnosability for Discrete-Event Systems
by
Liang, Ye
, Liu, Gaiyun
, El-Sherbeeny, Ahmed M.
in
Algorithms
/ Analysis
/ codiagnosability
/ computational complexity
/ decentralized diagnosis
/ discrete event system
/ Discrete event systems
/ Fault diagnosis
/ fault pattern
/ Mathematics
/ Polynomials
/ Robots
/ Verification
2023
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Polynomial-Time Verification of Decentralized Fault Pattern Diagnosability for Discrete-Event Systems
Journal Article
Polynomial-Time Verification of Decentralized Fault Pattern Diagnosability for Discrete-Event Systems
2023
Request Book From Autostore
and Choose the Collection Method
Overview
This paper considers the verification of decentralized fault pattern diagnosability for discrete event systems, where the pattern is modeled as a finite automaton whose accepted language is the objective to be diagnosed. We introduce a notion of codiagnosability to formalize the decentralized fault pattern diagnosability, which requires the pattern to be detected by one of the external local observers within a bounded delay. To this end, a structure, namely a verifier, is proposed to verify the codiagnosability of the system and the fault pattern. By studying an indeterminate cycle of the verifier, sufficient and necessary conditions are provided to test the codiagnosability. It is shown that the proposed method requires polynomial time at most. In addition, we present an approach to extend the proposed verifier structure so that it can be applied to centralized cases.
Publisher
MDPI AG
This website uses cookies to ensure you get the best experience on our website.