Browse by author
Lookup NU author(s): Dr Victor Khomenko
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
We propose a new, and to date the most general, framework for Petri net unfolding, which broadens its applicability, makes it easier to use, and increases its efficiency. In particular: (i) we propose a user-oriented view of the unfolding technique, which simply tells which information will be preserved in the final prefix and how to declare an event a cut-off in the algorithm, while hiding the technical parameters like the adequate order; (ii) the notion of the adequate order is generalised to a well-founded relation, and the requirement that it must refine ⊂ is replaced by a weaker one; and (iii) the order in which the unfolding algorithm selects the possible extensions of the prefix is entirely disentangled from the cut-off condition. We demonstrate the usefulness of the developed theory on some case studies.
Author(s): Bonet B, Haslum P, Khomenko V, Thiébaux S, Vogler W
Publication type: Article
Publication status: Published
Journal: Theoretical Computer Science
Print publication date: 25/09/2014
Online publication date: 15/07/2014
Acceptance date: 06/07/2014
ISSN (print): 0304-3975
Publisher: Elsevier BV
Altmetrics provided by Altmetric