Polynomial-time verification of diagnosability of partially observed discrete-event systems
Tóm tắt
The problem of verifying the properties of diagnosability and I-diagnosability is considered. We present new polynomial-time algorithms for deciding diagnosability and I-diagnosability. These algorithms are based on the construction of a nondeterministic automaton called a verifier.
Từ khóa
#Polynomials #Discrete event systems #State-space methods #Automata #System testing #Automatic testing #Observability #Energy managementTài liệu tham khảo
10.1109/9.400469
10.1007/BF02551817
10.1007/978-1-4757-4070-7
10.1023/A:1015625600613
cormen, 1990, Introduction to Algorithms
10.1109/9.940942
10.1109/9.412626