University of Twente Student Theses
Generation of Realistic Synthetic Petri Nets
Most, M.W. van der (2025) Generation of Realistic Synthetic Petri Nets.
|
PDF
510kB |
| Abstract: | Petri nets are directed, bipartite graphs consisting of places and transitions. They are widely used in computer science for modelling and analysing com- plex systems, such as concurrency, software design, and protocol validation. Developing algorithms for analysing Petri nets is an active field of research. To evaluate algorithms for analysing these models large amounts of bench- marks are needed. Due to the time consuming process of creating these by hand, there is a need for generating realistic and diverse benchmarks. To improve the realism and usefulness of synthetically generated Petri nets this research analyses Petri net datasets to extract structural attributes to create realistic bipartite graphs. Subsequently, adaptations of random graph models, specifically the Erdős–Rényi, Watts-Strogatz, Barabási–Albert and Chung-Lu models, were evaluated for realism on these attributes. While the Chung-Lu and Watts-Strogatz models were each able to capture some structural properties, no model was found to be able to generate highly realistic synthetic Petri nets. |
| Item Type: | Essay (Bachelor) |
| Faculty: | EEMCS: Electrical Engineering, Mathematics and Computer Science |
| Subject: | 54 computer science |
| Programme: | Computer Science BSc (56964) |
| Link to this item: | https://purl.utwente.nl/essays/105141 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page