Repeated fault diagnosability of decentralized discrete-event systems

Abstract

This paper extends the results about repeated fault diagnosability of monolithic discrete-event systems to systems with decentralized structure. To this end, it was introduced the notion of κ-codiagnosability, which basically consists of ensuring that at least one partially-observed diagnoser is able to accurately determine that a fault event has occurred at least κ times. Moreover, a necessary and sufficient condition for κ-codiagnosability is presented and an algorithm is proposed for its verification in discrete-event systems modeled by regular languages. This proposed algorithm is based on a verifier automaton and, thus, its computational complexity is polynomial.