Introduction to algorithms
Scaling Algorithms for the Shortest Paths Problem
SIAM Journal on Computing
Shortest paths algorithms: theory and experimental evaluation
Mathematical Programming: Series A and B
Diagnosis of large active systems
Artificial Intelligence
Diagnosis of Intermittent Faults
Discrete Event Dynamic Systems
Distributed Monitoring of Concurrent and Asynchronous Systems*
Discrete Event Dynamic Systems
Introduction to Discrete Event Systems
Introduction to Discrete Event Systems
Diagnosis of quantized systems based on a timed discrete-eventmodel
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Model-based detection of routing events in discrete flow networks
Automatica (Journal of IFAC)
Sequential window diagnoser for discrete-event systems under unreliable observations
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
| Hi-index | 0.01 |
We present an approach dealing with repeated fault events in the framework of model-based monitoring of discrete-event systems (DES). Various notions of diagnosability reported in the literature deal with uniformly bounded finite detection of counting delays over all faulty behaviors (uniform delays for brevity). The situation where the diagnosability notion of interest fails to hold under a given observation configuration leads typically to the deployment of more observational devices (e.g., sensors), which may be costly or infeasible. As an alternative to the additional deployment of observational devices, one might want to relax the uniformity of delays, while delays remain finite. To this end, we introduce a notion of diagnosability characterized with nonuniformly bounded finite counting delays (nonuniform counting delays for brevity), where finite delay bounds can vary on faulty behaviors. To evaluate the introduced notion of diagnosability with nonuniform counting delays, a polynomial-time verification algorithm is developed. Notably, the developed verification technique can readily be modified to construct a computationally superior verification algorithm for diagnosability under uniformly bounded finite counting delays (uniform counting delays for brevity) as compared to an algorithm previously reported in the literature. We also develop a novel on-line event counting algorithm that improves the time and space complexities of the currently available algorithms for the counting of special events.