A resource configuration method for liveness of a class of Petri nets

被引：1
|
作者：
Liu, Miao [1 ]
Wang, ShouGuang [2 ]
Hayat, Tasawar [3 ,4 ]
Alsaedi, Ahmed [4 ]
Li, ZhiWu [1 ,5 ,6 ]
机构：
[1] Xidian Univ, Sch Electromech Engn, Xian 710071, Peoples R China
[2] Zhejiang Gongshang Univ, Sch Informat & Elect Engn, Hangzhou 310018, Zhejiang, Peoples R China
[3] Quaid I Azam Univ, Dept Math, Islamabad 44000, Pakistan
[4] King Abdulaziz Univ, Dept Math, NAAM Res Grp, Fac Sci, Jeddah 21589, Saudi Arabia
[5] Macau Univ Sci & Technol, Inst Syst Engn, Taipa, Macau, Peoples R China
[6] King Abdulaziz Univ, Fac Engn, Jeddah 21589, Saudi Arabia
来源：
IMA JOURNAL OF MATHEMATICAL CONTROL AND INFORMATION | 2016年 / 33卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Petri net; resource configuration; flexible manufacturing system; FLEXIBLE MANUFACTURING SYSTEMS; DEADLOCK PREVENTION POLICY; OPTIMAL SUPERVISORY CONTROL; ELEMENTARY SIPHONS; ENFORCING SUPERVISORS; DEPENDENT SIPHONS; AVOIDANCE; DESIGN; FMS; CONSTRAINTS;
D O I：
10.1093/imamci/dnv016
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Petri nets are widely used to model flexible manufacturing systems (FMSs). A linear system of simple sequential processes with resources ((LSPR)-P-3), as an important subclass of Petri nets, can well model many FMSs. In this paper, a resource configuration method for liveness of an (LSPR)-P-3 is proposed. First, the relationship between the markings of resource places and process idle places in an (LSPR)-P-3 is analysed. Next, an algorithm used to compute the marking for each resource place in an (LSPR)-P-3 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.
引用
收藏
页码：933 / 950
页数：18
相关论文
共 50 条
  • [1] Liveness Enforcement for a Class of Petri Nets via Resource Allocation
    You, Dan
    Wang, Shouguang
    Dou, Hao
    Duo, Wenli
    Barkaoui, Kamel
    Seatzu, Carla
    2018 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2018, : 4355 - 4360
  • [2] A Resource Allocation Approach for Enforcing Liveness on a Class of Petri Nets
    You, Dan
    Wang, Shouguang
    Dou, Hao
    Duo, Wenli
    IEEE ACCESS, 2018, 6 : 48577 - 48587
  • [3] On Liveness and a Class of Generalized Petri Nets
    Abdul-Hussin, Mowfak H.
    Banaszak, Zbigniew A.
    2017 8TH ANNUAL INDUSTRIAL AUTOMATION AND ELECTROMECHANICAL ENGINEERING CONFERENCE (IEMECON), 2017, : 257 - 267
  • [4] Liveness characteristic analysis of a class of Petri nets
    Liu, Miao
    He, Zhou
    ADVANCES IN MECHANICAL ENGINEERING, 2018, 10 (06):
  • [5] Liveness and Resource Usage Ratio-Enforcing Supervisor for a Class of Generalized Petri Nets
    Liu, Ding
    Hou, YiFan
    Hu, HeSuan
    Barkaoui, Kamel
    Zhou, MengChu
    2013 10TH IEEE INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION (ICCA), 2013, : 1278 - 1283
  • [6] Deadlock and liveness characterization for a class of generalized Petri nets
    Liu, Miao
    Wang, ShouGuang
    Zhou, MengChu
    Liu, Ding
    Al-Ahmari, Abdulrahman
    Qu, Ting
    Wu, NaiQi
    Li, ZhiWu
    INFORMATION SCIENCES, 2017, 420 : 403 - 416
  • [7] Falut tolerant liveness analysis for a class of petri nets
    Hsieh, FS
    CCA 2003: PROCEEDINGS OF 2003 IEEE CONFERENCE ON CONTROL APPLICATIONS, VOLS 1 AND 2, 2003, : 1046 - 1051
  • [8] A polynomial algorithm to decide the liveness for a class of Petri nets
    Li, Zhiwu
    Liu, Ding
    Wang, Anrong
    PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, 2006, : 254 - 259
  • [9] A Method to Compute Resource Circuits in a Class of Petri Nets
    Wang, Shouguang
    Wang, Chengying
    Yu, Yanping
    ADVANCED MECHANICAL ENGINEERING, PTS 1 AND 2, 2010, 26-28 : 502 - 506
  • [10] A polynomial complexity algorithm to decide the liveness for a class of Petri nets
    Li, ZW
    Liu, D
    2005 INTERNATIONAL CONFERENCE ON CONTROL AND AUTOMATION (ICCA), VOLS 1 AND 2, 2005, : 1175 - 1180
12345