Stochastic DES Fault Diagnosis with Coloured Interpreted Petri Nets

[EN] This proposal presents an online method to detect and isolate faults in stochastic discrete event systems without previous model. A coloured timed interpreted Petri Net generates the normal behavior language after an identification stage.The next step is fault detection that is carried out by comparing the observed event sequences with the expected event sequences. Once a new fault is detected, a learning algorithm changes the structure of the diagnoser, so it is able to learn new fault languages. Moreover, the diagnoser includes timed events to represent and diagnose stochastic languages. Finally, this paper proposes a detectability condition for stochastic DES and the sufficient and necessary conditions are proved.This work was supported by a grant from the Universidad del Cauca, Reference 2.3-31.2/05 2011.Muñoz-Añasco, DM.; Correcher Salvador, A.; García Moreno, E.; Morant Anglada, FJ. (2015). Stochastic DES Fault Diagnosis with Coloured Interpreted Petri Nets. Mathematical Problems in Engineering. 2015:1-13. https://doi.org/10.1155/2015/303107S1132015Jiang, S., & Kumar, R. (2004). Failure Diagnosis of Discrete-Event Systems With Linear-Time Temporal Logic Specifications. IEEE Transactions on Automatic Control, 49(6), 934-945. doi:10.1109/tac.2004.829616Zaytoon, J., & Lafortune, S. (2013). Overview of fault diagnosis methods for Discrete Event Systems. Annual Reviews in Control, 37(2), 308-320. doi:10.1016/j.arcontrol.2013.09.009Sampath, M., Sengupta, R., Lafortune, S., Sinnamohideen, K., & Teneketzis, D. (1995). Diagnosability of discrete-event systems. IEEE Transactions on Automatic Control, 40(9), 1555-1575. doi:10.1109/9.412626Sampath, M., Sengupta, R., Lafortune, S., Sinnamohideen, K., & Teneketzis, D. C. (1996). Failure diagnosis using discrete-event models. IEEE Transactions on Control Systems Technology, 4(2), 105-124. doi:10.1109/87.486338Estrada-Vargas, A. P., López-Mellado, E., & Lesage, J.-J. (2010). A Comparative Analysis of Recent Identification Approaches for Discrete-Event Systems. Mathematical Problems in Engineering, 2010, 1-21. doi:10.1155/2010/453254Cabasino, M. P., Giua, A., & Seatzu, C. (2010). Fault detection for discrete event systems using Petri nets with unobservable transitions. Automatica, 46(9), 1531-1539. doi:10.1016/j.automatica.2010.06.013Prock, J. (1991). A new technique for fault detection using Petri nets. Automatica, 27(2), 239-245. doi:10.1016/0005-1098(91)90074-cAghasaryan, A., Fabre, E., Benveniste, A., Boubour, R., & Jard, C. (1998). Discrete Event Dynamic Systems, 8(2), 203-231. doi:10.1023/a:1008241818642Hadjicostis, C. N., & Verghese, G. C. (1999). Monitoring Discrete Event Systems Using Petri Net Embeddings. Application and Theory of Petri Nets 1999, 188-207. doi:10.1007/3-540-48745-x_12Benveniste, A., Fabre, E., Haar, S., & Jard, C. (2003). Diagnosis of asynchronous discrete-event systems: a net unfolding approach. IEEE Transactions on Automatic Control, 48(5), 714-727. doi:10.1109/tac.2003.811249Genc, S., & Lafortune, S. (2003). Distributed Diagnosis of Discrete-Event Systems Using Petri Nets. Lecture Notes in Computer Science, 316-336. doi:10.1007/3-540-44919-1_21Genc, S., & Lafortune, S. (2007). Distributed Diagnosis of Place-Bordered Petri Nets. IEEE Transactions on Automation Science and Engineering, 4(2), 206-219. doi:10.1109/tase.2006.879916Ramirez-Trevino, A., Ruiz-Beltran, E., Rivera-Rangel, I., & Lopez-Mellado, E. (2007). Online Fault Diagnosis of Discrete Event Systems. A Petri Net-Based Approach. IEEE Transactions on Automation Science and Engineering, 4(1), 31-39. doi:10.1109/tase.2006.872120Dotoli, M., Fanti, M. P., Mangini, A. M., & Ukovich, W. (2009). On-line fault detection in discrete event systems by Petri nets and integer linear programming. Automatica, 45(11), 2665-2672. doi:10.1016/j.automatica.2009.07.021Fanti, M. P., Mangini, A. M., & Ukovich, W. (2013). Fault Detection by Labeled Petri Nets in Centralized and Distributed Approaches. IEEE Transactions on Automation Science and Engineering, 10(2), 392-404. doi:10.1109/tase.2012.2203596Basile, F., Chiacchio, P., & De Tommasi, G. (2009). An Efficient Approach for Online Diagnosis of Discrete Event Systems. IEEE Transactions on Automatic Control, 54(4), 748-759. doi:10.1109/tac.2009.2014932Roth, M., Lesage, J.-J., & Litz, L. (2011). The concept of residuals for fault localization in discrete event systems. Control Engineering Practice, 19(9), 978-988. doi:10.1016/j.conengprac.2011.02.008Roth, M., Schneider, S., Lesage, J.-J., & Litz, L. (2012). Fault detection and isolation in manufacturing systems with an identified discrete event model. International Journal of Systems Science, 43(10), 1826-1841. doi:10.1080/00207721.2011.649369Chung-Hsien Kuo, & Han-Pang Huang. (2000). Failure modeling and process monitoring for flexible manufacturing systems using colored timed Petri nets. IEEE Transactions on Robotics and Automation, 16(3), 301-312. doi:10.1109/70.850648Ramirez-Trevino, A., Ruiz-Beltran, E., Aramburo-Lizarraga, J., & Lopez-Mellado, E. (2012). Structural Diagnosability of DES and Design of Reduced Petri Net Diagnosers. IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, 42(2), 416-429. doi:10.1109/tsmca.2011.2169950Cabasino, M. P., Giua, A., & Seatzu, C. (2014). Diagnosability of Discrete-Event Systems Using Labeled Petri Nets. IEEE Transactions on Automation Science and Engineering, 11(1), 144-153. doi:10.1109/tase.2013.2289360Yao, L., Feng, L., & Jiang, B. (2014). Fault Diagnosis and Fault Tolerant Control for Non-Gaussian Singular Time-Delayed Stochastic Distribution Systems. Mathematical Problems in Engineering, 2014, 1-9. doi:10.1155/2014/937583Murata, T. (1989). Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4), 541-580. doi:10.1109/5.24143Dotoli, M., Fanti, M. P., & Mangini, A. M. (2008). Real time identification of discrete event systems using Petri nets. Automatica, 44(5), 1209-1219. doi:10.1016/j.automatica.2007.10.014Muñoz, D. M., Correcher, A., García, E., & Morant, F. (2014). Identification of Stochastic Timed Discrete Event Systems with st-IPN. Mathematical Problems in Engineering, 2014, 1-21. doi:10.1155/2014/835312Latorre-Biel, J.-I., Jiménez-Macías, E., Pérez de la Parte, M., Blanco-Fernández, J., & Martínez-Cámara, E. (2014). Control of Discrete Event Systems by Means of Discrete Optimization and Disjunctive Colored PNs: Application to Manufacturing Facilities. Abstract and Applied Analysis, 2014, 1-16. doi:10.1155/2014/821707Cabasino, M. P., Giua, A., Lafortune, S., & Seatzu, C. (2012). A New Approach for Diagnosability Analysis of Petri Nets Using Verifier Nets. IEEE Transactions on Automatic Control, 57(12), 3104-3117. doi:10.1109/tac.2012.2200372Abdelwahed, S., Karsai, G., Mahadevan, N., & Ofsthun, S. C. (2009). Practical Implementation of Diagnosis Systems Using Timed Failure Propagation Graph Models. IEEE Transactions on Instrumentation and Measurement, 58(2), 240-247. doi:10.1109/tim.2008.200595

A new approach for diagnosability analysis of Petri nets using Verifier Nets

In this paper, we analyze the diagnosability properties of labeled Petri nets. We consider the standard notion of diagnosability of languages, requiring that every occurrence of an unobservable fault event be eventually detected, as well as the stronger notion of diagnosability in K steps, where the detection must occur within a fixed bound of K event occurrences after the fault. We give necessary and sufficient conditions for these two notions of diagnosability for both bounded and unbounded Petri nets and then present an algorithmic technique for testing the conditions based on linear programming. Our approach is novel and based on the analysis of the reachability/coverability graph of a special Petri net, called Verifier Net, that is built from the Petri net model of the given system. In the case of systems that are diagnosable in K steps, we give a procedure to compute the bound K. To the best of our knowledge, this is the first time that necessary and sufficient conditions for diagnosability and diagnosability in K steps of labeled unbounded Petri nets are presented

Fault detection for discrete event systems using Petri nets with unobservable transitions

In this paper we present a fault detection approach for discrete event systems using Petri nets. We assume that some of the transitions of the net are unobservable, including all those transitions that model faulty behaviors. Our diagnosis approach is based on the notions of basis marking and justification, that allow us to characterize the set of markings that are consistent with the actual observation, and the set of unobservable transitions whose firing enable it. This approach applies to all net systems whose unobservable subnet is acyclic. If the net system is also bounded the proposed approach may be significantly simplified by moving the most burdensome part of the procedure off-line, thanks to the construction of a graph, called the basis reachability graph

Quantification and compensation of the impact of faults in system throughput

Performability relates the performance (throughput) and reliability of software systems whose normal behaviour may degrade owing to the existence of faults. These systems, naturally modelled as discrete event systems using shared resources, can incorporate fault-tolerant techniques to mitigate such a degradation. In this article, compositional faulttolerant models based on Petri nets, which make its sensitive performability analysis easier, are proposed. Besides, two methods to compensate existence of faults are provided: an iterative algorithm to compute the number of extra resources needed, and an integer-linear programming problem that minimises the cost of incrementing resources and/or decrementing fault-tolerant activities. The applicability of the developed methods is shown on a Petri net that models a secure database system. Keywords Performability, fault-tolerant techniques, Petri nets, integer-linear programmin

Production system identification with genetic programming

Modern system-identification methodologies use artificial neural nets, integer linear programming, genetic algorithms, and swarm intelligence to discover system models. Pairing genetic programming, a variation of genetic algorithms, with Petri nets seems to offer an attractive, alternative means to discover system behaviour and structure. Yet to date, very little work has examined this pairing of technologies. Petri nets provide a grey-box model of the system, which is useful for verifying system behaviour and interpreting the meaning of operational data. Genetic programming promises a simple yet robust tool to search the space of candidate systems. Genetic programming is inherently highly parallel. This paper describes early experiences with genetic programming of Petri nets to discover the best interpretation of operational data. The systems studied are serial production lines with buffers

Model based fault diagnosis for hybrid systems : application on chemical processes

The complexity and the size of the industrial chemical processes induce the monitoring of a growing number of process variables. Their knowledge is generally based on the measurements of system variables and on the physico-chemical models of the process. Nevertheless, this information is imprecise because of process and measurement noise. So the research ways aim at developing new and more powerful techniques for the detection of process fault. In this work, we present a method for the fault detection based on the comparison between the real system and the reference model evolution generated by the extended Kalman filter. The reference model is simulated by the dynamic hybrid simulator, PrODHyS. It is a general object-oriented environment which provides common and reusable components designed for the development and the management of dynamic simulation of industrial systems. The use of this method is illustrated through a didactic example relating to the field of Chemical Process System Engineering

Diagnosability Analysis of Labeled Time Petri Net Systems

In this paper, we focus on two notions of diagnosability for labeled Time Petri net (PN) systems: K-diagnosability implies that any fault occurrence can be detected after at most K observations, while τ-diagnosability implies that any fault occurrence can be detected after at most τ time units. A procedure to analyze such properties isprovided.The proposedapproach uses the Modified State Class Graph, a graph the authors recently introduced for the marking estimation of labeled Time PN systems,which providesan exhaustive description of the system behavior. A preliminary diagnosabilty analysis of the underlying logic system based on classical approaches taken from the literature is required. Then, the solution of some linear programming problems should be performed to take into account the timing constraints associated with transitions