Abstract
Petri nets are widely used to model flexible manufacturing systems (FMSs). A linear system of simple sequential processes with resources (LS\$^3\$PR), as an important subclass of Petri nets, can well model many FMSs. In this paper, a resource configuration method for liveness of an LS\$^3\$PR is proposed. First, the relationship between the markings of resource places and process idle places in an LS\$^3\$PR is analysed. Next, an algorithm used to compute the marking for each resource place in an LS\$^3\$PR is developed by taking the full advantages of resource subnets. Finally, the computational complexity of the algorithm is proved to be polynomial. Two examples are used to illustrate the application of the proposed method.
Users
Please
log in to take part in the discussion (add own reviews or comments).