论文信息 - Parallel algorithm for computation of deadlocks and traps in Petri nets

Parallel algorithm for computation of deadlocks and traps in Petri nets

In the paper the method of computation all deadlocks and traps in the Petri net is presented. This method is based on Thelen method. Methods of calculation of all deadlocks and traps in Petri nets are very time consuming. Therefore it is very important to optimize a computation. The parallel computation method for the time reduction is proposed. Experimental results of presented method are discussed, as well

A. Wegrzyn

[1] Amnon Barak,et al. The MOSIX Distributed Operating System: Load Balancing for UNIX , 1993 .

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

[3] H.-J. Mathony. Universal logic design algorithm and its application to the synthesis of two-level switching circuits , 1989 .

[4] Amnon Barak,et al. The MOSIX multicomputer operating system for high performance cluster computing , 1998, Future Gener. Comput. Syst..

[5] Kamel Barkaoui,et al. Deadlocks and traps in Petri nets as Horn-satisfiability solutions and some related polynomially solvable problems , 1990, Discret. Appl. Math..

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

[7] Peter Radford,et al. Petri Net Theory and the Modeling of Systems , 1982 .

[8] Amnon Barak,et al. Distributed UNIX file systems , 1993 .