TY - GEN A1 - Schwarick, Martin A1 - Rohr, Christian A1 - Liu, Fei A1 - Assaf, George A1 - Chodak, Jacek A1 - Heiner, Monika T1 - Efficient Unfolding of Coloured Petri Nets using Interval Decision Diagrams T2 - Application and Theory of Petri Nets and Concurrency : 41st International Conference, PETRI NETS 2020, Paris, France, June 24–25, 2020, Proceedings N2 - We consider coloured Petri nets, qualitative and quantitative ones alike, as supported by our PetriNuts tool family, comprising, among others, Snoopy, Marcie and Spike. Currently, most analysis and simulation techniques require to unfold the given coloured Petri net into its corresponding plain, uncoloured Petri net representation. This unfolding step is rather straightforward for finite discrete colour sets, but tends to be time-consuming due to the potentially huge number of possible transition bindings. We present an unfolding approach building on a special type of symbolic data structures, called Interval Decision Diagram, and compare its runtime performance with an unfolding engine employing an off-the-shelf library to solve constraint satisfaction problems. For this comparison we use the 22 scalable coloured models from the MCC benchmark suite, complemented by a few from our own collection. KW - Coloured Petri KW - Unfolding KW - Symbolic data structures KW - Interval decision diagrams Y1 - 2020 SN - 978-3-030-51830-1 SN - 978-3-030-51831-8 U6 - https://doi.org/10.1007/978-3-030-51831-8_16 SP - 324 EP - 344 PB - Springer CY - Cham ER -