A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Canonical prefixes of Petri net unfoldings
2003
Acta Informatica
In this paper, we develop a general technique for truncating Petri net unfoldings, parameterized according to the level of information about the original unfolding one wants to preserve. Moreover, we propose a new notion of completeness of a truncated unfolding, which with the standard parameters is strictly stronger than that given in [5, 6] , and is more appropriate for the existing model checking algorithms. A key aspect of our approach is an algorithm-independent notion of cut-off events,
doi:10.1007/s00236-003-0122-y
fatcat:n76auledibdzrdnzssp7sw27uu