Parallelisation of the Petri Net Unfolding Algorithm
Keijo Heljanko, Khomenko, Maciej Koutny · 2001
Abstract. In this paper, we first present theoretical results, helping to understand the unfolding algorithm presented in [5, 6]. We then propose a modification of this algorithm, which can be efficiently parallelised, and prove its correctness. We also present additional optimisations.