Discrete event control system design using automation Petri nets and their ladder diagram implementation

Uzam, Murat; Jones, A.H.

doi:10.1007/bf01438224

Cited by 68 publications

(50 citation statements)

References 8 publications

(9 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…All of these advantages are analogical to the cited executable specifications. Moreover, there are some similar approaches to the one proposed in this work [28][29][30][31][32][33][34][35][36][37][38][39]41]. Implementation of some of them can also be seen as a programming language.…”

Section: Comparison To Related Workmentioning

confidence: 99%

A Program Model of Fuzzy Interpreted Petri Net to Control Discrete Event Systems

Markiewicz

Gniewek

2017

Applied Sciences

View full text Add to dashboard Cite

Using Petri nets (PNs) to control discrete event systems (DES) has many benefits, because of their graphical representations, the possibility of parallel process control, and their formal descriptions. Amongst the different PNs that are applied for this purpose, most have some limitations for visualization. For many of these PNs, another restriction is the length of time between the creation of the control algorithm in the form of a graph and its practical implementation. These two issues can be resolved with one solution called fuzzy interpreted PN (FIPN). This article proposes the use of a program model based on FIPN to control DES and the method for generation of this model using the graphical representation of the net. FIPN offers a better visualization in comparison to discrete PNs and it allows for the quick creation of program code through the application of a simulator called FIPN-SML. This computer tool implements a method that transforms the graphical form of FIPN into Structured Text (ST) language supported by the IEC 61131-3.

show abstract

Section: Comparison To Related Workmentioning

confidence: 99%

A Program Model of Fuzzy Interpreted Petri Net to Control Discrete Event Systems

Markiewicz

Gniewek

2017

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…FPGA-based PLC has been generally discussed by many previous researchers [2][3][4][5][6][7][8][9][10][11][12][13]. From practical view point, it is a very valuable solution to implement FPGA-based PLC by converting ladder diagram, which is the most popular programming language, to VHDL program, which is also the most popular hardware description language for FPGA design.…”

Section: Fpga-based Plc Designmentioning

confidence: 99%

“…Therefore, a bridge is needed to eliminate this gap between these two programs. Several researchers used the modeling method like FSM or Petri net as the bridge [5][6][7][8][9][10]15]. Actually, a complicated ladder diagram probably consists of thousands of states so that it may easily cause the FSM or Petri net model extreme complex and hard to handle.…”

Section: Implementation Of the Conversion From Ladder Diagram To Vhdlmentioning

confidence: 99%

“…Abdel-Hamid et al [5] and Kuusilinna et al [6] developed an algorithm to convert finite state machine (FSM) into VHDL. Adamski, M. et al [7][8][9][10] did an effective work in choosing Petri net model as a substitute of ladder diagram in manufacturing control. These studies show that reconfigurable hardware has advantages of simplicity of programming, size, and cost, while parallel execution of FPGA can improve the PLC performance dramatically.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A study on the generation of silicon-based hardware Plc by means of the direct conversion of the ladder diagram to circuit design language

Yamazaki

2009

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Programmable logic controller (PLC) is one of the most important components in today's manufacturing. Its performance-based microprocessor and software have been a bottleneck for improving its efficiency. To enhance the PLC performance and flexibility, a new PLC design based on field programmable gate array (FPGA) has been a hot topic because of its parallel execution mechanism and reconfigurable hardware structure. From practical viewpoint, in this paper, the authors propose an approach to implement the existing ladder diagram (LD) inside FPGA making full use of the advantage of FPGA device. The essential of this research includes two issues: (a) analyze the LD program and organize it with sequential and parallel structure and (b) implement the sequential and parallel structure of the LD program with hardware description language inside FPGA. To the first work, the condensed simultaneity graph theory is applied to optimize the LD program with sequential and parallel structure. To the second work, Boolean equations are taken as the bridge to convert the optimized LD program to the hardware description language program. Finite state machine is used to generate sensitive signals to guarantee that the performance of the converted very high-speed integrated circuit hardware description language design is the same as the original ladder diagram. A case study is practiced to verify the proposed approach in this paper.

show abstract

“…The authors in [24] use Petri nets to model the operated behaviors and to synthesize the command filters in a command filtering framework. Automation Petri nets can be used to perform the design and implementation of discrete event control systems by converting automation Petri nets into ladder diagrams on programmable logic controllers [25].…”

Section: Introductionmentioning

confidence: 99%

An Enhanced Supervisory Control Strategy for Periodicity Mutual Exclusions in Discrete Event Systems Based on Petri Nets

Jiang¹,

Wang²,

Chen³

et al. 2017

Discrete Dynamics in Nature and Society

View full text Add to dashboard Cite

Mutual exclusion problems widely exist in discrete event systems in which several processes will compete for the common resource for maintaining their normal running. This competition is mutually exclusive. However, a special behavior, that is, periodic mutual exclusion behavior, is important for many discrete event systems. Once a process obtains the common resource, it will consecutively obtain the common resource in the following several competitions. The other processes should wait for the release of the common resource. All processes will compete for the common resource again after the common resource is released. These competitions have obvious periodicity. In this paper, a methodology is proposed to design periodic mutual exclusion supervisors to control the periodic mutual exclusion behavior in discrete event systems. Moreover, two original structural conversion concepts, called -derivation and -convergence processes, are proposed to construct the periodic mutual exclusion supervisors. The discussion results show that many undesirable execution sequences are forbidden since the periodic mutual exclusion behavior is controlled by the proposed periodic mutual exclusion supervisors. Finally, an example is used to illustrate the proposed methodology.

show abstract

Discrete event control system design using automation Petri nets and their ladder diagram implementation

Abstract: As automated manufacturing systems become more complex, the need for an effective design tool to produce both highlevel discrete event control systems (DECS)

Cited by 68 publications

References 8 publications

A Program Model of Fuzzy Interpreted Petri Net to Control Discrete Event Systems

A Program Model of Fuzzy Interpreted Petri Net to Control Discrete Event Systems

A study on the generation of silicon-based hardware Plc by means of the direct conversion of the ladder diagram to circuit design language

An Enhanced Supervisory Control Strategy for Periodicity Mutual Exclusions in Discrete Event Systems Based on Petri Nets

Contact Info

Product

Resources

About