论文信息 - Deadlock Checking Using Net Unfoldings

Deadlock Checking Using Net Unfoldings

McMillan presented a deadlock detection technique based on unfoldings of Petri net systems. It is realized by means of a backtracking algorithm that has its drawback for unfoldings that increase widely. We present an approach that exploits precisely this property. Moreover, we introduce a fast implementation of McMillan's algorithm and compare it with our new technique.

Stephan Melzer | Stefan Römer | S. Melzer | Stefan Römer

[1] Glynn Winskel,et al. Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[2] Glynn Winskel,et al. Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..

[3] Alain J. Martin. The Design of a Self-timed Circuit for Distributed Mutual Exclusion , 1983 .

[4] Eike Best,et al. Nonsequential Processes: A Petri Net View , 1988 .

[5] Manfred Droste. Event Structures and Domains , 1989, Theor. Comput. Sci..

[6] Tadao Murata,et al. Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

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

[8] Hans-Günther Linde-Göers. Compositional partial order semantics of Petri boxes , 1994 .

[9] Javier Esparza,et al. Checking System Properties via Integer Programming , 1996, ESOP.

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