Codiagnosticabilidade de sistemas a eventos discretos com observação dinâmica

Abstract

In this work, a new algorithm for verifying the codiagnosticability of a language in discrete event systems (DES) with dynamic observation is proposed. Codiagnosticability in DESs with dynamic observation has been addressed by other studies in the literature. Each of the methods currently available in the literature capable of dealing with this problem are considered and compared with the method proposed here. This comparison validates the results, since this new verifier, in general, has a lower computational cost than the others, although all have polynomial complexity.