Algorithms for the verification of synchronous diagnosability and computation of the delay bound for diagnosis of modular Discrete Event Systems
Felipe Gomes de Oliveira Cabral1; Jean Hilaire Adebai Tomola2; Marcos Vicente de Brito Moreira1
1 Universidade Federal do Rio de Janeiro; 2 Instituto Federal do Rio de Janeiro
Resumo
In general, systems are formed by the composition of several components, and may exhibit a large number of states. The growth of the global system model with the number of system components leads to high computational costs for diagnosis techniques based on the global model. Recently, a new approach to online diagnosis of modular systems that avoids the computation of the global system model is presented. The new approach has lead to the definition of synchronous diagnosability of modular systems. Although this method avoids the computational growth for online diagnosis, the verification of the synchronous diagnosability of the system is exponential in the number of system components and states. Moreover, the delay bound for synchronous diagnosis has not been computed. In this paper, we present an algorithm for the verification of synchronous diagnosability with lower computational complexity than the algorithm proposed in the literature, and we also present an algorithm for the computation of the delay bound for diagnosis of modular systems.
Palavras-chave: Discrete-event systems; Synchronous diagnosability; Modular systems