A new approach to supervisor design with sequential control Petri-net using minimization technique for discrete event system

2005 ◽  
Vol 29 (11-12) ◽  
pp. 1267-1277 ◽  
Author(s):  
G. Cansever ◽  
I. B. Kucukdemiral
2012 ◽  
Vol 4 ◽  
pp. 80-85 ◽  
Author(s):  
Xing Long Pan ◽  
Guo He ◽  
Chao Jie Zhang ◽  
Ting Feng Ming ◽  
Xiao Chuan Wang

A framework of modeling and simulating a typical artificial system is proposed based on discrete event system and Petri net. Firstly, the system model is constructed based on discrete event system theory. Secondly, the model is described and analyzed by using Petri net. Then, the simulation procedures on Matlab platform are presented in detail. The proposed framework is applied to modeling and simulating a logical control system of a marine diesel engine. The simulation results indicate that this logical control system model can be constructed by the given framework and the proposed method is effective in simulating and analyzing this kind of artificial system.


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.


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.


1999 ◽  
Vol 32 (2) ◽  
pp. 4917-4922
Author(s):  
Patrick Sarri ◽  
Addi Ait Hssain ◽  
Eric Niel

Author(s):  
Soheil Arastehfar ◽  
Ying Liu ◽  
Wen Feng Lu

This paper introduces a new discrete event system (DES) model for supervising and controlling trajectory planning tasks and robot motion using automata. This model is proposed based on a new approach, namely mask description. Masks are constructed adaptively and are modified based on the error between the original path and the planned path. The model acts in two phases, mask construction phase (MCP) and end-effecter positioning phase (E2P2). In MCP, it tries to plan a path, and in E2P2 it tries to place the end-effecter along the sequence of points on the path. The model describes a path in the Cartesian space and moves the end-effecter in the joint variable space, and therefore, MCP plans the path as accurate as Cartesian space description, and E2P2 position the robot as fast as joint space description. Results show that the proposed adaptive masking is remarkably efficient in computing.


Sign in / Sign up

Export Citation Format

Share Document