Computation of Admissible Marking Sets in Weighted State Machines by Dynamic Programming

被引：0
作者：
Ma, Ziyue [1 ,2 ]
Li, Zhiwu [1 ,2 ,3 ]
Giua, Alessandro [4 ,5 ]
机构：
[1] Xidian Univ, Sch Electromech Engn, Xian 710071, Shaanxi, Peoples R China
[2] Univ Cagliari, Dipartimento Ingn Elettr & Elettron, Cagliari, Italy
[3] Macau Univ Sci & Technol, Inst Syst Engn, Taipa, Macao, Peoples R China
[4] Univ Toulon & Var, Aix Marseille Univ, CNRS, EN SAM,LSIS, Marseille, France
[5] Univ Cagliari, DIEE, I-09124 Cagliari, Italy
来源：
2017 IEEE 56TH ANNUAL CONFERENCE ON DECISION AND CONTROL (CDC) | 2017年
基金：
中国国家自然科学基金;
关键词：
FLEXIBLE MANUFACTURING SYSTEMS; MUTUAL EXCLUSION CONSTRAINTS; DISCRETE-EVENT SYSTEMS; PETRI-NET CONTROLLERS; DEADLOCK PREVENTION; SUPERVISORS; DESIGN; TRANSITIONS; AVOIDANCE; SIPHONS;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper we aim to characterize the admissible marking set in partially controllable Petri nets with weighted arcs. We consider a special subclass of generalized Petri nets called weighted state machines (WSMs) that have state-machine topology with weighted arcs. Such subclass of nets can be used to model systems of practical interest characterized by operations executed in batches. We propose a dynamic programming method to compute the admissible marking set of an elementary GMEC for a net in this subclass. Such a result can be used to design an online control logic to ensure that the current marking is always covered by some maximal admissible markings and is always admissible.
引用
收藏
页数：6
相关论文
共 26 条
  • [1] Feedback control logic for backward conflict free choice nets
    Basile, Francesco
    Carbone, Ciro
    Chiacchio, Pasquale
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2007, 52 (03) : 387 - 400
  • [2] A branch and bound approach for the design of decentralized supervisors in Petri net models
    Basile, Francesco
    Cordone, Roberto
    Piroddi, Luigi
    [J]. AUTOMATICA, 2015, 52 : 322 - 333
  • [3] Bellman R. E., 1957, Dynamic programming. Princeton landmarks in mathematics
  • [4] Fault model identification and synthesis in Petri nets
    Cabasino, Maria Paola
    Giua, Alessandro
    Hadjicostis, Christoforos N.
    Seatzu, Carla
    [J]. DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2015, 25 (03): : 419 - 440
  • [5] Fault detection for discrete event systems using Petri nets with unobservable transitions
    Cabasino, Maria Paola
    Giua, Alessandro
    Seatzu, Carla
    [J]. AUTOMATICA, 2010, 46 (09) : 1531 - 1539
  • [6] Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
    Chen, YuFeng
    Li, Zhiwu
    [J]. AUTOMATICA, 2011, 47 (05) : 1028 - 1034
  • [7] Designing Optimal Deadlock Avoidance Policies for Sequential Resource Allocation Systems Through Classification Theory: Existence Results and Customized Algorithms
    Cordone, Roberto
    Nazeem, Ahmed
    Piroddi, Luigi
    Reveliotis, Spyros
    [J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2013, 58 (11) : 2772 - 2787
  • [8] A survey of Petri net methods for controlled discrete event systems
    Holloway, LE
    Krogh, BH
    Giua, A
    [J]. DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 1997, 7 (02): : 151 - 190
  • [9] Computing bounds for forbidden state reachability functions for controlled Petri nets
    Holloway, LE
    Khare, AS
    Gong, Y
    [J]. IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS, 2004, 34 (02): : 219 - 228
  • [10] Supervision based on place invariants: A survey
    Iordache, M. V.
    Antsaklis, P. J.
    [J]. DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2006, 16 (04): : 451 - 492
123