For the most recent entries see the Petri Nets Newsletter.

Parallelisation of the Petri Net Unfolding Algorithm.

Heljanko, Keijo; Khomenko, Victor; Koutny, Maciej

In: J.-P. Katoen, P. Stevens (Eds.): Tools and Algorithms for the Construction and Analysis of Systems, 8th International Conference, TACAS 2002 (Part of ETAPS 2002), Grenoble, France, April 8-12, 2002, pages 1-371pp. Springer Verlag, LNCS 2280, March 2002.

Abstract: In this paper, we first present theoretical results, helping to understand the unfolding algorithm presented before. 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.

Keywords: Model checking; Petri nets; parallel algorithms; unfolding; causality; concurrency.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography