Methods for Efficient Unfolding of Colored Petri Nets

Autor: Bilgram, Alexander, Jensen, Peter G., Pedersen, Thomas, Srba, Jiri, Taankvist, Peter H.

Publikováno v: Fundamenta Informaticae, Volume 189, Issues 3-4: Reachability Problems 2020 and 2021 (October 14, 2023) fi:9351

Colored Petri nets offer a compact and user friendly representation of the traditional P/T nets and colored nets with finite color ranges can be unfolded into the underlying P/T nets, however, at the expense of an exponential explosion in size. We pr

Externí odkaz: http://arxiv.org/abs/2204.07039

Improvements in Unfolding of Colored Petri Nets

Autor: Bilgram, Alexander, Jensen, Peter G., Pedersen, Thomas, Srba, Jiří, Taankvist, Peter H.

Publikováno v: Bilgram, A, Jensen, P G, Pedersen, T, Srba, J & Taankvist, P H 2021, Improvements in Unfolding of Colored Petri Nets . in P C Bell, P Totzke & I Potapov (eds), Reachability Problems : 15th International Conference, RP 2021, Liverpool, UK, October 25–27, 2021, Proceedings . Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13035 LNCS, pp. 69-84, 15th International Conference on Reachability Problems, RP 2021, Liverpool, United Kingdom, 25/10/2021 . https://doi.org/10.1007/978-3-030-89716-1_5

Colored Petri nets offer a compact and user friendly representation of the traditional P/T nets and colored nets with finite color ranges can be unfolded into the underlying P/T nets, however, at the expense of an exponential explosion in size. We pr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::db70f4e36bea71124fff8bf60710b364
https://vbn.aau.dk/da/publications/c3d3bf71-3d2d-4207-9768-68b58642523f