Supervisory control of timed-place marked graph based on Marking Exclusion Constraint

This paper presents a control synthesis approach for Discrete Event Systems (DES) modeled by Timed Place Marked Graphs TPMG where the time is associated with places. It solves a forbidden state problems characterized by Marking Exclusion Constraint (MEC). A computationally efficient technique to build the supervisor is proposed, which we take in consideration the uncontrollable and/or unobservable nature of some events. The time makes our control policies more permissive by allowing the system to reach more states (marking) which were considered as dangerous marking in partially controllable Marked Graph. We depend on the initial marking as known marking to build time-tables that show us the timeline of marking distribution over the system. These time-tables help to build a Control Law Table (CLT), through analysis the information in this table the supervisor may determine the moment of its intervention.

[1]  C. Ramchandani,et al.  Analysis of asynchronous concurrent systems by timed petri nets , 1974 .

[2]  Kunihiko Hiraishi,et al.  Analysis and control of discrete event systems represented by petri nets , 1988 .

[3]  Alessandro Giua,et al.  Petri Net Supervisors for Generalized Mutual Exclusion Constraints , 1993 .

[4]  Nidhal Rezg,et al.  Feedback control logic for forbidden-state problems of marked graphs: application to a real manufacturing system , 2003, IEEE Trans. Autom. Control..

[5]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[6]  P. Merlin,et al.  Recoverability of Communication Protocols - Implications of a Theoretical Study , 1976, IEEE Transactions on Communications.

[7]  B. Krogh,et al.  On closed-loop liveness of discrete event systems under maximally permissive control , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[8]  Bruce H. Krogh,et al.  Synthesis of feedback control logic for a class of controlled Petri nets , 1990 .

[9]  P. Antsaklis,et al.  Reduced-order controllers for continuous and discrete-time singular H ∞ control problems based on LMI , 1996 .

[10]  Nidhal Rezg,et al.  Control Synthesis for Partially Controlled Marked Graph Subject to Marking Exclusion Constraints , 2010 .

[11]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[12]  Nidhal Rezg,et al.  Supervisory control of partially observable marked graphs , 2004, IEEE Transactions on Automatic Control.

[13]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[14]  N. Rezg,et al.  Supervisory Control of partially observable Marked Graph based on Marking Exclusion Constraint , 2010 .

[15]  W. Wonham,et al.  Control of vector discrete-event systems. II. Controller synthesis , 1994, IEEE Trans. Autom. Control..

[16]  P. Ramadge,et al.  Modular Feedback Logic for Discrete Event Systems , 1987 .

[17]  Xiaolan Xie,et al.  Algebraic and geometric characterization of Petri net controllers using the theory of regions , 2002, Sixth International Workshop on Discrete Event Systems, 2002. Proceedings..

[18]  Alessandro Giua,et al.  Generalized mutual exclusion contraints on nets with uncontrollable transitions , 1992, [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics.

[19]  N. Rezg,et al.  On the supervisory control of marked graphs , 2008, 2008 IEEE International Conference on Industrial Engineering and Engineering Management.

[20]  Panos J. Antsaklis,et al.  Uncontrollable and Unobservable Transitions , 1998 .