dc.contributor.author | Davidrajuh, Reggie | |
dc.contributor.author | Krenczyk, Damian | |
dc.contributor.author | Skolud, Bozena | |
dc.date.accessioned | 2023-01-20T14:38:34Z | |
dc.date.available | 2023-01-20T14:38:34Z | |
dc.date.created | 2019-07-24T14:52:09Z | |
dc.date.issued | 2019 | |
dc.identifier.citation | Davidrajuh, R., Krenczyk, D., & Skolud, B. (2019). Finding Clusters in Petri Nets. An approach based on GPenSIM. Modeling, Identification and Control. 2019, 40 (1), 1-10. | en_US |
dc.identifier.issn | 0332-7353 | |
dc.identifier.uri | https://hdl.handle.net/11250/3045023 | |
dc.description.abstract | Graph theory provides some methods for finding clusters in networks. Clusters reflect the invisible grouping of the elements in a network. This paper presents a new method for finding clusters in networks. In this method, the user can adjust a parameter to change the number of clusters. This method is newly added to the simulator General-purpose Petri Net Simulator (GPenSIM) as a function for network analysis. With this GPenSIM function, in addition to the usual performance analysis of a discrete-event system via a Petri net model, supplementary information about the grouping of the elements can also be found. Finding clusters in discrete-event systems provides valuable information such as the ideal location of the elements in a manufacturing network. This paper also presents an application example on a flexible manufacturing system. | en_US |
dc.language.iso | eng | en_US |
dc.rights | Navngivelse 4.0 Internasjonal | * |
dc.rights.uri | http://creativecommons.org/licenses/by/4.0/deed.no | * |
dc.title | Finding Clusters in Petri Nets An approach based on GPenSIM | en_US |
dc.type | Peer reviewed | en_US |
dc.type | Journal article | en_US |
dc.description.version | publishedVersion | en_US |
dc.rights.holder | The authors | en_US |
dc.subject.nsi | VDP::Teknologi: 500 | en_US |
dc.source.pagenumber | 1-10 | en_US |
dc.source.volume | 40 | en_US |
dc.source.journal | Modeling, Identification and Control | en_US |
dc.source.issue | 1 | en_US |
dc.identifier.doi | 10.4173/mic.2019.1.1 | |
dc.identifier.cristin | 1712606 | |
cristin.ispublished | true | |
cristin.fulltext | original | |
cristin.qualitycode | 1 | |