Selected publications by Stefan Schwoon

In a seminal paper, McMillan proposed a technique for constructing a finite complete prefix of the unfolding of bounded (i.e., finite-state) Petri nets, which can be used for verification purposes. Contextual nets are a generalisation of Petri nets suited to model systems with read-only access to resources. When working with contextual nets, a finite complete prefix can be obtained by applying McMillan's construction to a suitable encoding of the contextual net into an ordinary net. However, it has been observed that if the unfolding is itself a contextual net, then the complete prefix can be significantly smaller than the one obtained with the above technique. A construction for generating such a contextual complete prefix has been proposed for a special class of nets, called read-persistent. In this paper we propose a new algorithm that works for arbitrary semi-weighted, bounded contextual nets. The construction explicitly takes into account the fact that, unlike ordinary or read-persistent nets, an event can have several different histories in contextual net computations.

   address = {Siedlce, Poland},
   author = {Baldan, Paolo and Corradini, Andrea and K{\"o}nig, Barbara and Schwoon, Stefan},
   booktitle = {{P}roceedings of the {W}orkshop on {U}n{FO}lding and partial order techniques ({UFO}'07)},
   editor = {Fabre, {\'E}ric and Khomenko, Victor},
   month = jun,
   pages = {32-49},
   publisher = {Publishing House of University of Podlasie},
   title = {{M}c{M}illan's complete prefix for contextual nets},
   url = {},
   year = {2007},

About LSV