A method to check liveness of WS3PR

Author

Wang Shouguang ; Liu Miao ; Zhou Mengchu ; Wu Wenhui

Author_Institution

Sch. of Inf. & Electron. Eng., Zhejiang Gongshang Univ., Hangzhou, China

fYear

2014

fDate

28-30 July 2014

Firstpage

4028

Lastpage

4033

Abstract

Petri nets are widely used to model flexible manufacturing systems (FMSs) because they can help analyze the properties and synthesize deadlock-free supervisory controllers of FMS. Weighted System of Simple Sequential Processes with Resources (WS³PR) is an important subclass of Petri nets that can well model many FMSs. This work first gives new algorithms to check liveness for a WS3PR net via its subnet trees and structure. Then the computation complexity for the proposed method is shown in this paper, to be polynomial under certain limitations. Finally, sufficient conditions for deciding liveness of a WS³PR are established. An example is used to illustrate the results.

Keywords

Petri nets; computational complexity; control system synthesis; flexible manufacturing systems; polynomials; FMS; Petri nets; WS³PR; computation complexity; deadlock-free supervisory controller synthesis; flexible manufacturing systems; liveness checking; polynomial; subnet structure; subnet trees; weighted system of simple sequential processes with resources; Artificial neural networks; Educational institutions; Electronic mail; Laboratories; Manufacturing systems; Modeling; Petri nets; Liveness; Petri net; deadlock; flexible manufacturing system;

fLanguage

English

Publisher

ieee

Conference_Titel

Control Conference (CCC), 2014 33rd Chinese

Conference_Location

Nanjing

Type

conf

DOI

10.1109/ChiCC.2014.6895612

Filename

6895612