Reachability Graph of IOPT Petri Net Models Using CUDA C++ Parallel Application - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

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

Résumé

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 co-processing 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.
Fichier principal
Vignette du fichier
496588_1_En_8_Chapter.pdf (342.4 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03741552 , version 1 (01-08-2022)

Licence

Paternité

Identifiants

Citer

Carolina Lagartinho-Oliveira, Filipe Moutinho, Luís Gomes. Reachability Graph of IOPT Petri Net Models Using CUDA C++ Parallel Application. 11th Doctoral Conference on Computing, Electrical and Industrial Systems (DoCEIS), Jul 2020, Costa de Caparica, Portugal. pp.93-100, ⟨10.1007/978-3-030-45124-0_8⟩. ⟨hal-03741552⟩
20 Consultations
41 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More