Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] |

¡@

**Daniel Yuh Chao**

National Chengchi University

Taipei, 116 Taiwan

E-mail: yaw@mis.nccu.edu.tw

Finding all minimal bad siphons is essential for deadlock control. However, the number of siphons grows exponentially with the size of the system. Deadlock occurs due to inappropriate resource sharing. Hence most research focused on the problem of minimal siphon extraction covering a set of places representing resources ¡X an NP-Complete problem for arbitrary Petri Nets. We develop the theory for efficient extraction of minimal bad siphons for S3PR (systems of simple sequential processes) proposed by Ezpeleta et al. The number of minimal bad siphons that needs to be searched is linear to the number of resources. The rest can be found by adding and deleting common sets of places from existing ones significantly reducing the search time. It is very interesting that both nets and siphons can be synthesized by first locating a circuit followed by adding handles.

*
Keywords:
*
Petri nets, siphons, traps, FMS, algorithm, liveness, deadlock

Retrieve PDF document (**200701_11.pdf**)

Received October 28, 2004; revised February 18, 2005; accepted July 11, 2005.

Communicated by Ding-Zhu Du.