Alexander Bilgram ; Peter G. Jensen ; Thomas Pedersen ; Jiri Srba ; Peter H. Taankvist - Methods for Efficient Unfolding of Colored Petri Nets

fi:9351 - Fundamenta Informaticae, October 14, 2023, Volume 189, Issues 3-4: Reachability Problems 2020 and 2021
Methods for Efficient Unfolding of Colored Petri NetsArticle

Authors: Alexander Bilgram ; Peter G. Jensen ; Thomas Pedersen ; Jiri Srba ; Peter H. Taankvist

    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.


    Volume: Volume 189, Issues 3-4: Reachability Problems 2020 and 2021
    Published on: October 14, 2023
    Accepted on: January 30, 2023
    Submitted on: April 15, 2022
    Keywords: Computer Science - Logic in Computer Science

    Consultation statistics

    This page has been seen 63 times.
    This article's PDF has been downloaded 51 times.