English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Colored Petri nets offer a compact and user friendly representation of thetraditional P/T nets and colored nets with finite color ranges can be unfoldedinto the underlying P/T nets, however, at the expense of an exponentialexplosion in size. We present two novel techniques based on static analysis inorder to reduce the size of unfolded colored nets. The first method identifiescolors that behave equivalently and groups them into equivalence classes,potentially reducing the number of used colors. The second methodoverapproximates the sets of colors that can appear in places and excludescolors that can never be present in a given place. Both methods arecomplementary and the combined approach allows us to significantly reduce thesize of multiple colored Petri nets from the Model Checking Contest benchmark.We compare the performance of our unfolder with state-of-the-art techniquesimplemented in the tools MCC, Spike and ITS-Tools, and while our approach iscompetitive w.r.t. unfolding time, it also outperforms the existing approachesboth in the size of unfolded nets as well as in the number of answered modelchecking queries from the 2021 Model Checking Contest.

Methods for Efficient Unfolding of Colored Petri Nets