Improvements in Unfolding of Colored Petri Nets

Bilgram, Alexander; Jensen, Peter Gjøl; Pedersen, Thomas Garm; Srba, Jǐŕı; Taankvist, Peter

doi:10.1007/978-3-030-89716-1_5

Cited by 3 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This paper is an extended version of the conference paper [24] with full proofs, complete definitions and additional examples and last but not least a substantial reimplementation of the methods in the tool TAPAAL with improved experimential results compared to [24].…”

Section: Introductionmentioning

confidence: 99%

Methods for Efficient Unfolding of Colored Petri Nets

Bilgram¹,

Jensen²,

Pedersen³

et al. 2022

Preprint

Self Cite

View full text Add to dashboard Cite

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 present two novel techniques based on static analysis in order to reduce the size of unfolded colored nets. The first method identifies colors that behave equivalently and groups them into equivalence classes, potentially reducing the number of used colors. The second method overapproximates the sets of colors that can appear in places and excludes colors that can never be present in a given place. Both methods are complementary and the combined approach allows us to significantly reduce the size of multiple colored Petri nets from the Model Checking Contest benchmark. We compare the performance of our unfolder with state-of-the-art techniques implemented in the tools MCC, Spike and ITS-Tools, and while our approach is competitive w.r.t. unfolding time, it also outperforms the existing approaches both in the size of unfolded nets as well as in the number of answered model checking queries from the 2021 Model Checking Contest.

show abstract

Section: Introductionmentioning

confidence: 99%