Codiagnosability Analysis of Discrete-Event Systems Modeled by Weighted Automata
- 4 February 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 64 (10) , 4361-4368
Abstract
In building failure diagnosis systems for discrete-event systems, two performance indexes must be specified: (i) the maximum time the diagnosis system takes to detect the failure occurrence, usually referred to as T-diagnosability; and (ii) if no time information is available, how many events must occur after the failure in order for the diagnosis system to detect and isolate its occurrence, usually referred to as K-diagnosability. In this technical note, we consider the problem of verifying if these specifications can be met for discrete-event systems modeled by finite weighted automaton; we regard the ordinary finite automaton as a particular case of weighted automaton with all weights equal to one. The resulting algorithms have polynomial time complexity, being the lowest worst case computational complexity among those already proposed in the literature for T- and K-codiagnosability verification of finite state automata.Keywords
Funding Information
- Brazilian Research Council (309652/2017-0)
- Ministry of Education
This publication has 18 references indexed in Scilit:
- Diagnosability Analysis of Labeled Time Petri Net SystemsIEEE Transactions on Automatic Control, 2016
- Computation of the maximum time for failure diagnosis of discrete-event systems2015
- “Polynomial Time Verification of Decentralized Diagnosability of Discrete Event Systems” Versus “Decentralized Failure Diagnosis of Discrete Event Systems”: A Critical AppraisalIEEE Transactions on Automatic Control, 2015
- Verification of Codiagnosability for Discrete Event Systems Modeled by Mealy Automata With Nondeterministic Output FunctionsIEEE Transactions on Automatic Control, 2012
- The Synthesis of Time Optimal Supervisors by Using Heaps-of-PiecesIEEE Transactions on Automatic Control, 2011
- Diagnosability Test for Timed Discrete-Event Systems2006
- Polynomial-time verification of diagnosability of partially observed discrete-event systemsIEEE Transactions on Automatic Control, 2002
- Fault Diagnosis for Timed Automata2002
- Diagnosability of discrete-event systemsIEEE Transactions on Automatic Control, 1995
- A theory of timed automataTheoretical Computer Science, 1994