Parallelisation of the Petri Net Unfolding Algorithm

In this paper, we first present theoretical results, helping to understand the unfolding algorithm presented in [6],[7]. We then propose a modification of this algorithm, which can be efficiently parallelised and admits a more efficient implementation. Our experiments demonstrate that the degree of parallelism is usually quite high and resulting algorithms potentially can achieve significant speedup comparing with the sequential case.