GPGPU applied to support the construction of the state-space graphs of IOPT Petri net models

Lagartinho-Oliveira, Carolina; Moutinho, Filipe; Gomes, Luís

doi:10.1109/iecon.2019.8927556

Cited by 3 publications

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although, there is a GPU CPU limit to the number of threads per block, a kernel can be executed by multiple blocks in parallel, so the total number of threads launched is equal to the number of threads per block times the number of blocks thar compose the grid. A set of functions, such as __threadfence, __syncthreads, and atomic operations, can be used to ensure the correct access to shared and global memory, avoiding hazards that can occur from simultaneous read and write operations at the same memory address [24].…”

Section: Cuda Architecturementioning

confidence: 99%

Reachability Graph of IOPT Petri Net Models Using CUDA C++ Parallel Application

Lagartinho-Oliveira

Moutinho

Gomes

2020

IFIP Advances in Information and Communication Technology

Self Cite

View full text Add to dashboard Cite

The construction of reachability graphs is suited to verify the properties and behavior of Petri net models based on the structure of the net and the initial marking. It allows checking whether a model conforms to the intended specification of a system and to obtain information about it. This paper proposes an algorithm to compute the reachability graphs of IOPT (Input-Output Place-Transition) nets, which is a Petri net class, using NVIDIA's CUDA (Compute Unified Device Architecture), which supports the coprocessing using GPU and CPU. While CPU is used to schedule threads on GPU, GPU is used to calculate all the child nodes of the reachability graph, including the management of a hash-table for efficiently storing the new states and retrieving the states stored in the database. The presented algorithm takes advantage of CUDA memory functions to allocate and access data that can be used by code running on CPU or GPU, supporting the share of data between the two processor units. Six IOPT net models were used to validate the proposed algorithm.

show abstract

Section: Cuda Architecturementioning

confidence: 99%

Reachability Graph of IOPT Petri Net Models Using CUDA C++ Parallel Application

Lagartinho-Oliveira

Moutinho

Gomes

2020

IFIP Advances in Information and Communication Technology

Self Cite

View full text Add to dashboard Cite

show abstract

“…The growing complexity of PLC technology and user-imposed operational and security requirements require the development of novel control mechanisms. Petri nets are a mathematical and graphical modeling tool for industrial systems [1,4,[6][7][8][9][10][11][12][13][14][15][16][17][18][19][20]. Petri nets have several advantages over other programming tools, such as simple schematic diagram, hierarchical algorithms, and simple algebraic expression [21,22].…”

Section: Introductionmentioning

confidence: 99%

A Novel Method for Converting Colored Petri Nets to Ladder Diagram in the Automation of Automated Manufacturing Systems

et al. 2023

View full text Add to dashboard Cite

The Ladder Diagram (LD) is an industry-standard programming language for constructing automated manufacturing systems (AMSs) control algorithms. Petri net (PN) theory, on the other hand, is a mathematical and graphical modeling tool for AMSs. Multiple types of PN-based LDs are designed for AMSs with highly complicated LD structures. Thus, it is necessary to propose a technique that can assist in the minimization of the structural complexity of LDs. The main purpose of this study is to propose a methodology for the implementation of LDs in AMSs. First, a colored resource-oriented Petri net (CROPN) is developed for modeling and guaranteeing the deadlock-free behavior of AMS. Second, a ladder diagram CROPN (LDCROPN) is constructed in order to transform the CROPN into an LD. The proposed LDCROPN is assessed using instances from the literature. The results show that the LDCROPN is effective, has a simpler structure, and has less computational overhead than existing techniques.

show abstract

“…The everincreasing complexity of the PLC software and user-imposed operational and security specifications require new techniques to meet the control requirements. Petri nets (PNs) are a very interesting and useful graphical and mathematical tool for the modeling and control of manufacturing systems [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16][17]. Indeed, PNs have advantages over other languages, including simple graphical representation (circles, rectangles, and arcs), structured algorithms, and simple algebraic representation [18,19].…”

Section: Introductionmentioning

confidence: 99%

Colored Resource-Oriented Petri Net Based Ladder Diagrams for PLC Implementation in Reconfigurable Manufacturing Systems

Kaid

Al-Ahmari

2020

IEEE Access

View full text Add to dashboard Cite

A typical example of discrete event systems (DESs) is a reconfigurable manufacturing system (RMS) whose can be changed and become more complicated during its operation. Thus, an effective tool needs to be developed to create both high-and low-level DES implementation. The ladder diagram (LD) is a common programming method for controlling DESs. Petri nets (PNs) represent the most important graphical and mathematical tool that can be used to provide an integrated solution for the design, modeling, analysis, control, and implementation of DESs. Various types of PN-based LDs are developed for DESs, which have high structural complexity of the LDs. Therefore, an approach that can facilitate the elimination of the LDs' structural complexity needs to be developed. The main objective of this paper is to develop a two-step approach for LDs implementation for RMSs with dynamic changes. First, a colored resource-oriented Petri net (CROPN)-based algorithm is proposed for a rapid and valid configurations of an RMS. Second, a ladder diagram colored resource-oriented Petri net (LDCROPN) is developed to convert the CROPN into an LD. The developed approach is evaluated using examples in the literature. Moreover, the results demonstrate the effectiveness of the developed approach for LD implementation under RMS specification changes.

show abstract

GPGPU applied to support the construction of the state-space graphs of IOPT Petri net models

Cited by 3 publications

References 21 publications

Reachability Graph of IOPT Petri Net Models Using CUDA C++ Parallel Application

Reachability Graph of IOPT Petri Net Models Using CUDA C++ Parallel Application

A Novel Method for Converting Colored Petri Nets to Ladder Diagram in the Automation of Automated Manufacturing Systems

Colored Resource-Oriented Petri Net Based Ladder Diagrams for PLC Implementation in Reconfigurable Manufacturing Systems

Contact Info

Product

Resources

About