Efficient decomposition algorithms for flexible manufacturing systems modelled by free choice nets

The aim of this paper is to construct an efficient algorithm to find an S-decomposition and an SM-decomposition where each S-component contains only one token. These algorithms can be applied in deadlock detection and repetitive behaviour control in flexible manufacturing systems. Basic definitions and notations are shown. A polynomial order algorithm to find an S-decomposition is presented. A polynomial order algorithm to find an SM-decomposition of a live and safe free choice net is also presented.<
>