| Abstract | Deadlock prevention in Resource Allocation Systems with shared resources represents an important goal in systems design. When using Petri net based modeling, typical methods for attaining this goal use syphon analysis. This paper develops a new method to prevent deadlock in S3PR nets based on minimal siphons and Pruning Graphs. The method consists in two steps: first is the increasing of the number of copies of a replicable resource and second is the splitting of the total copies of the replicable resources. We use the Pruning Graph to choose the replicable resources we are going to split. The algorithm uses only structural information of the net and a simple example is used to illustrate its application. |
