Canonical Prefixes of Petri Net Unfoldings

In this paper, we develop a general technique for truncating Petri net unfoldings, parameterised 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. A key aspect of our approach is an algorithm- independent notion of cut-off events, used to truncate a Petri net unfolding. Such a notion is based on a cutting context and results in …