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

Author

Nishimura, T. ; Lee, D.I. ; Kumagai, S. ; Kodama, S.

Author_Institution

Osaka Gas Co. Ltd., Japan

fYear

1993

fDate

17-20 Oct 1993

Firstpage

618

Abstract

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

Keywords

Petri nets; computational complexity; flexible manufacturing systems; polynomials; production control; S-decomposition; SM-decomposition; deadlock detection; decomposition algorithms; flexible manufacturing systems; free choice nets; polynomial order algorithm; repetitive behaviour control; Algorithm design and analysis; Character recognition; Concurrent computing; Control systems; Flexible manufacturing systems; Petri nets; Polynomials; Power system modeling; System recovery; Terminology;

fLanguage

English

Publisher

ieee

Conference_Titel

Systems, Man and Cybernetics, 1993. 'Systems Engineering in the Service of Humans', Conference Proceedings., International Conference on

Conference_Location

Le Touquet

Print_ISBN

0-7803-0911-1

Type

conf

DOI

10.1109/ICSMC.1993.384812

Filename

384812