Acta Informatica

, Volume 40, Issue 2, pp 95–118 | Cite as

Canonical prefixes of Petri net unfoldings

  • Victor KhomenkoEmail author
  • Maciej Koutny
  • Walter Vogler


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. 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 the unique canonical prefix of the unfolding. Canonical prefixes are complete in the new, stronger sense, and we provide necessary and sufficient conditions for its finiteness, as well as upper bounds on its size in certain cases. A surprising result is that after suitable generalization, the standard unfolding algorithm presented in [8], and the parallel unfolding algorithm proposed in [12], despite being non-deterministic, generate the canonical prefix. This gives an alternative correctness proof for the former algorithm, and a new (much simpler) proof for the latter one.


Strong Sense Surprising Result General Technique Correctness Proof Alternative Correctness 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin/Heidelberg 2003

Authors and Affiliations

  1. 1.School of Computing ScienceUniversity of NewcastleNewcastle upon TyneUK
  2. 2.Institut für InformatikUniversität AugsburgAugsburgGermany

Personalised recommendations