scholarly journals Inference of fault signatures of discrete-event systems from event logs

10.29007/qmpw ◽  
2018 ◽  
Author(s):  
Cody Christopher ◽  
Yannick Pencolé ◽  
Alban Grastien

In this paper, we propose a method to diagnose faults in a discrete event system that only relies on past observed logs and not on any behavioural model of the system. Given a set of tagged logs produced by the system, the first objective is to extract from them a set of fault signatures. These fault signatures are represented with a set of critical observations that are the support of the diagnosis method. We first propose a method to compute the fault signatures from an initial log journal and follow with detail on how the signatures can then be updated when new logs are available.

Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-14 ◽  
Author(s):  
Juan-Ignacio Latorre-Biel ◽  
Emilio Jiménez-Macías ◽  
Mercedes Pérez de la Parte

Discrete event systems in applications, such as industry and supply chain, may show a very complex behavior. For this reason, their design and operation may be carried out by the application of optimization techniques for decision making in order to obtain their highest performance. In a general approach, it is possible to implement these optimization techniques by means of the simulation of a Petri net model, which may require an intensive use of computational resources. One key factor in the computational cost of simulation-based optimization is the size of the model of the system; hence, it may be useful to apply techniques to reduce it. This paper analyzes the relationship between two Petri net formalisms, currently used in the design of discrete event systems, where it is usual to count on a set of alternative structural configurations. These formalisms are a particular type of parametric Petri nets, called compound Petri nets, and a set of alternative Petri nets. The development of equivalent models under these formalisms and the formal proof of this equivalence are the main topics of the paper. The basis for this formal approach is the graph of reachable markings, a powerful tool able to represent the behavior of a discrete event system and, hence, to show the equivalence between two different Petri net models. One immediate application of this equivalence is the substitution of a large model of a system by a more compact one, whose simulation may be less demanding in the use of computational resources.


Author(s):  
Irīna Šitova ◽  
Jeļena Pečerska

The research is carried out in the area of analysis of simulation results. The aim of this research is to explore the applicability of process mining techniques, and to introduce the process mining techniques integration into results analysis of discrete-event system simulations. As soon as the dynamic discrete-event system simulation (DESS) is based on events list or calendar, most of simulators provide the events lists. These events lists are interpreted as event logs in this research, and are used for process mining. The information from the events list is analysed to extract process-related information and perform in-depth process analysis. Event log analysis verified applicability of the proposed approach. Based on the results of this research, it can be concluded that process mining techniques in simulation results analysis provide a possibility to reveal new knowledge about the performance of the system, and to find the parameter values providing the advisable performance.


2020 ◽  
Author(s):  
A. Davydov ◽  
A. Larionov ◽  
N. Nagul

The paper provides a general view on the original logical inference based approach to dealing with discrete event systems as subject to supervisory control theory. The approach proposes a representation of automata-based discrete event system as a positively constructed formula and implementation of the calculus of positively constructed formulas. The stages of a supervisor construction are illustrated with a simplified model of an autonomous underwater vehicle operational modes switching. The supremal controllable sublanguage of the specification and the supervisor are constructed.


2020 ◽  
Vol 3 (2) ◽  
pp. 133-147
Author(s):  
Lathifatul Aulia ◽  
Widowati Widowati ◽  
R. Heru Tjahjana ◽  
Sutrisno Sutrisno

Discrete event systems, also known as DES, are class of system that can be applied to systems having an event that occurred instantaneously and may change the state. It can also be said that a discrete event system occurs under certain conditions for a certain period because of the network that describes the process flow or sequence of events. Discrete event systems belong to class of nonlinear systems in classical algebra. Based on this situation, it is necessary to do some treatments, one of which is linearization process. In the other hand, a Max-Plus Linear system is known as a system that produces linear models. This system is a development of a discrete event system that contains synchronization when it is modeled in Max-Plus Algebra. This paper discusses the production system model in manufacturing industries where the model pays the attention into the process flow or sequence of events at each time step. In particular, Model Predictive Control (MPC) is a popular control design method used in many fields including manufacturing systems. MPC for Max-Plus-Linear Systems is used here as the approach that can be used to model the optimal input and output sequences of discrete event systems. The main advantage of MPC is its ability to provide certain constraints on the input and output control signals. While deciding the optimal control value, a cost criterion is minimized by determining the optimal time in the production system that modeled as a Max-Plus Linear (MPL) system. A numerical experiment is performed in the end of this paper for tracking control purposes of a production system. The results were good that is the controlled system showed a good performance.


2008 ◽  
Vol 19 (04) ◽  
pp. 999-1013 ◽  
Author(s):  
HSU-CHUN YEN

The conventional forbidden state problem for discrete event systems is concerned with the issue of synthesizing a maximally permissive control policy to prevent a discrete event system from reaching any forbidden state during the course of its computation. In this paper, we regard the forbidden state problem as a decision problem, and investigate the decidability/complexity issue of the problem under two new types of control policies, namely, non-blocking and fair policies, for finite state systems and Petri nets.


PetriNet is an imperative and handy language used for modeling and analysis of discrete event system (DES) i.e. a dynamic system that progress according to unexpected occurrence of events at probably unknown, asymmetrical interval of time. This concept provides an interface for analysis of behavioral and structural properties like liveness, boundedness and cover-ability tree of discrete event systems. These properties are not only necessary for proving the correctness of system model but also helpful in checking the deadlock conditions in a system. As a graph Petri Net is used for modeling and mathematically, it can be used for analysis of the system. In this paper, we have first modeled various DES like computation model and communication model using Petri Nets and then analyzed their properties using MATLAB. These DES models have applications in almost every domain of science and engineering.


2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Ye Dandan ◽  
Luo Jiliang ◽  
Su Hongye

This study proposes a fault diagnosis method of discrete event systems on the basis of a Petri net model with partially observable transitions. Assume that the structure of the Petri net model and the initial marking are known, and the faults can be modeled by its unobservable transitions. One of the contributions of this work is the use of the structure information of Petri net to construct an online fault diagnoser which can describe the system behavior of normal or potential faults. By modeling the flow of tokens in particular places that contain fault information, the variation of tokens in these places may be calculated. The outputs and inputs of these places are determined to be enabled or not through analyzing some special structures. With the structure information, traversing all the states is not required. Furthermore, the computational complexity of the polynomial allows the model to meet real-time requirements. Another contribution of this work is to simplify the subnet model ahead of conducting the diagnostic process with the use of reduction rules. By removing some nodes that do not contain the necessary diagnostic information, the memory cost can be reduced.


Sign in / Sign up

Export Citation Format

Share Document