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.

[1]  A. P. Sistla,et al.  Automatic verification of finite-state concurrent systems using temporal logic specifications , 1986, TOPL.

[2]  R. BurchJ.,et al.  Symbolic model checking , 1992 .

[3]  Kenneth L. McMillan,et al.  Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits , 1992, CAV.

[4]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[5]  Walter Vogler,et al.  An Improvement of McMillan's Unfolding Algorithm , 1996, Formal Methods Syst. Des..

[6]  James C. Corbett,et al.  Evaluating Deadlock Detection Methods for Concurrent Software , 1996, IEEE Trans. Software Eng..

[7]  Stephan Melzer,et al.  Deadlock Checking Using Net Unfoldings , 1997, CAV.

[8]  Keijo Heljanko.  DEADLOCK AND REACHABILITY CHECKING WITH FINITE COMPLETE PREFIXES , 1999 .

[9]  Keijo Heljanko.  Using Logic Programs with Stable Model Semantics to Solve Deadlock and Reachability Problems for 1-Safe Petri Nets , 1999, Fundam. Informaticae.

[10]  Javier Esparza,et al.  An Unfolding Algorithm for Synchronous Products of Transition Systems , 1999, CONCUR.

[11]  Javier Esparza,et al.  Reachability Analysis Using Net Unfoldings , 2000 .

[12]  Maciej Koutny,et al.  LP Deadlock Checking Using Partial Order Dependencies , 2000, CONCUR.

[13]  Stephan Merz,et al.  Model Checking , 2000 .

[14]  Maciej Koutny,et al.  An Efficient Algorithm for Unfolding Petri Nets , 2001 .

[15]  Maciej Koutny,et al.  Towards an Efficient Algorithm for Unfolding Petri Nets , 2001, CONCUR.

[16]  Maciej Koutny,et al.  Canonical prefixes of Petri net unfoldings , 2002, Acta Informatica.