• search hit 5 of 8
Back to Result List

Efficient Unfolding of Coloured Petri Nets using Interval Decision Diagrams

  • 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.

Export metadata

Additional Services

Search Google Scholar
Metadaten
Author: Martin Schwarick, Christian Rohr, Fei LiuORCiD, George Assaf, Jacek Chodak, Monika HeinerORCiD
DOI:https://doi.org/10.1007/978-3-030-51831-8_16
ISBN:978-3-030-51830-1
ISBN:978-3-030-51831-8
Title of the source (English):Application and Theory of Petri Nets and Concurrency : 41st International Conference, PETRI NETS 2020, Paris, France, June 24–25, 2020, Proceedings
Publisher:Springer
Place of publication:Cham
Document Type:Conference publication peer-reviewed
Language:English
Year of publication:2020
Tag:Coloured Petri; Interval decision diagrams; Symbolic data structures; Unfolding
First Page:324
Last Page:344
Series ; volume number:Lecture Notes in Computer Science book series ; volume 12152
Faculty/Chair:Fakultät 1 MINT - Mathematik, Informatik, Physik, Elektro- und Informationstechnik / FG Datenstrukturen und Softwarezuverlässigkeit
Einverstanden ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.