A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2004; you can also visit the original URL.
The file type is application/pdf
.
Parallelisation of the Petri Net Unfolding Algorithm
[chapter]
2002
Lecture Notes in Computer Science
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. In this section, we first present basic definitions concerning Petri nets, and then recall (see also [3, 5, 6] ) notions related to net unfoldings. Petri nets A net is a triple N df = (P, T, F ) such that P and T are
doi:10.1007/3-540-46002-0_26
fatcat:wbxf5txmerdy3fj7e4rooxo6da