Algorithms for Extracting Minimal Siphons Containing Specified Places in a General Petri Net (Special Section on Concurrent Systems Technology)

Given a Petri net PN = (P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of minimal siphons containing a given specified set Q of places, the paper proposes three algorithms based on the branch-and-bound method for enumerating, if any, all minimal siphons containing Q, as well as for extracting such one minimal siphon. key words: Petri nets, minimal siphons, branch-and-bound algorithms, siphon extraction

[1]  Erwin R. Boer,et al.  Generating basis siphons and traps of Petri nets using the sign incidence matrix , 1994 .

[2]  Javier Esparza,et al.  Minimal deadlocks in free choice nets , 1989 .

[3]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4]  Manuel Silva,et al.  A Simple and Fast Algorithm to Obtain All Invariants of a Generalized Petri Net , 1980, Selected Papers from the First and the Second European Workshop on Application and Theory of Petri Nets.

[5]  M. Yamauchi,et al.  Finding Minimal Siphons in General Petri Nets , 1996 .

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

[7]  Toshimasa Watanabe,et al.  A heuristic algorithm FSD for the legal firing sequence problem of Petri nets , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[8]  Kamel Barkaoui,et al.  An Efficient Algorithm for Finding Structural Deadlocks in Colored Petri Nets , 1993, Application and Theory of Petri Nets.

[9]  Toshimasa Watanabe,et al.  Extracting siphons containing a specified set of places in a Petri net , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[10]  M. Yamauchi,et al.  A fast and space-saving algorithm for computing invariants of Petri nets , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[11]  Peter Kemper,et al.  Linear Time Algorithm to Find a Minimal Deadlock in a Strongly Connected Free-Choice Net , 1993, Application and Theory of Petri Nets.

[12]  Wolfgang Reisig,et al.  Petri Nets , 1985, EATCS Monographs on Theoretical Computer Science.

[13]  山内 雅弘,et al.  A Fast and Space-Saving Algorihtm FMSN for Computing Petri Net Invariants with Supports Containing All Specified Nodes , 1999 .

[14]  M. Yamauchi,et al.  Finding a minimal siphon containing specified places in a general Petri net , 1996 .

[15]  Falko Bause,et al.  An Efficient Polynomial-Time Algorithm to Decide Liveness and Boundedness of Free-Choice Nets , 1992, Application and Theory of Petri Nets.

[16]  Toshimasa Watanabe,et al.  Time Complexity Analysis of the Minimal Siphon Extraction Problem of Petri Nets (Special Section on Concurrent Systems Technology) , 1999 .

[17]  Toshimasa Watanabe,et al.  Legal firing sequence and related problems of Petri nets , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[18]  Toshimasa Watanabe,et al.  New Priority-Lists for Scheduling in Timed Petri Nets , 1993, Application and Theory of Petri Nets.

[19]  James Lyle Peterson,et al.  Petri net theory and the modeling of systems , 1981 .

[20]  T. Matsumoto.  The necessary and sufficient condition for structural liveness of general Petri nets containing structural-live minimal deadlocks , 1994 .