Diagnosis of large active systems
Artificial Intelligence
Distributed Diagnosis for Qualitative Systems
WODES '02 Proceedings of the Sixth International Workshop on Discrete Event Systems (WODES'02)
Distributed diagnosis of discrete-event systems using Petri nets
ICATPN'03 Proceedings of the 24th international conference on Applications and theory of Petri nets
Reachability analysis of real-time systems using time Petri nets
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Fault Modeling in Discrete Event Systems Using Petri Nets
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Modeling and Verification of Discrete Event Systems
| Hi-index | 0.00 |
This paper proposes an algorithm for the model based design of a distributed protocol for fault detection and diagnosis for very large systems. The overall process is modeled as different Time Petri Net (TPN) models (each one modeling a local process) that interact with each other via guarded transitions that becomes enabled only when certain conditions (expressed as predicates over the marking of some places) are satisfied (the guard is true). In order to use this broad class of time DES models for fault detection and diagnosis we derive in this paper the timing analysis of the TPN models with guarded transitions. In this paper we also extend the modeling capability of the faults calling some transitions faulty when operations they represent take more or less time than a prescribed time interval corresponding to their normal execution. We consider here that different local agents receive local observation as well as messages from neighboring agents. Each agent estimates the state of the part of the overall process for which it has model and from which it observes events by reconciling observations with model based predictions. We design algorithms that use limited information exchange between agents and that can quickly decide ''questions'' about ''whether and where a fault occurred?'' and ''whether or not some components of the local processes have operated correctly?''. The algorithms we derive allow each local agent to generate a preliminary diagnosis prior to any communication and we show that after communicating the agents we design recover the global diagnosis that a centralized agent would have derived. The algorithms are component oriented leading to efficiency in computation.