Feedback control logic for forbidden-state problems of marked graphs: application to a real manufacturing system

Ghaffari, Asma; Rezg, Nidhal; Xie, Xiaolan

doi:10.1109/tac.2002.806651

Cited by 85 publications

(71 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this part we provide a brief presentation of the control synthesis approach proposed in [8]. First of all, we recall the definitions and the properties of marked graphs and the PN notations that will be used throughout this paper.…”

Section: Marked Graph and Control Synthesismentioning

confidence: 99%

“…The aim of the research work we present in this paper is to extend the control synthesis technique given in [8] and build a supervisor to guarantee that the closed loop system is deadlock free.…”

Section: Deadlock Analysismentioning

confidence: 99%

“…Furthermore, [8] proposes a solution to the forbidden state problem for bounded or non bounded marked graphs with controllable and uncontrollable transitions. This method uses the structural proprieties of marked graph to build a very computational efficient controller.…”

Section: Introductionmentioning

confidence: 99%

“…In this paper, we consider the control synthesis approach proposed in [8]. We analyze the deadlock occurrence and we propose an approach for deadlock free control synthesis dedicated to marked graphs not necessarily bounded and not necessarily safe.…”

Section: Introductionmentioning

confidence: 99%

“…Section 2 reviews important definitions related to marked graphs and presents the control synthesis method given in [8]. The deadlock avoidance approach for independent critical places is presented in Sec.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Deadlock freeness supervisor for marked graph

Sioud¹,

Achour²,

Sava³

et al. 2009

Bulletin of the Polish Academy of Sciences: Technical Sciences

Self Cite

View full text Add to dashboard Cite

Abstract. This note presents a control synthesis approach for discrete event systems modeled by marked graphs with uncontrollable transitions. The forbidden behavior is specified by General Mutual Exclusion Constraints (GMEC). We prove that, even if the system to be controlled is live, the closed loop control may generate deadlock situations. Using the structural proprieties of marked graph we defined the causes of deadlock situations, and we defined a formal method to avoid them.

show abstract

Section: Marked Graph and Control Synthesismentioning

confidence: 99%

Section: Deadlock Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Deadlock freeness supervisor for marked graph

Sioud¹,

Achour²,

Sava³

et al. 2009

Bulletin of the Polish Academy of Sciences: Technical Sciences

Self Cite

View full text Add to dashboard Cite

show abstract

Confusion diagnosis and avoidance of discrete event systems using supervisory control

Chen

et al. 2015

IEEJ Transactions Elec Engng

View full text Add to dashboard Cite

Nondeterministic firing of concurrent transitions in Petri nets (PNs) may lead to the disappearance of conflicts. The disappearance implies that the partial conflicting transitions in a conflict become disabled before the resolution of the conflict. The phenomenon is called confusions that are caused by the interlacement of conflicting and concurrent transitions in PNs, which generates incomplete and faulty system conflicting behavior such that conflicts cannot be correctly resolved. In this paper, conflict‐increasing confusions (CICs) and conflict‐decreasing confusions (CDCs) in a PN are investigated. The relation graph of conflicts and confusions (RGC2) in a PN is proposed to detect the structure of confusions. To avoid the occurrence of confusions in a PN, an algorithm based on generalized mutual exclusion constraints (GMECs) is proposed, which can generate confusion‐avoidance supervisors such that the occurrence of conflicts can be ensured in a PN. Finally, an example of confusion detection and avoidance in a flexible assembly system is presented. © 2015 Institute of Electrical Engineers of Japan. Published by John Wiley & Sons, Inc.

show abstract

A hybrid approach to supervisory control of discrete event systems coupling RW supervisors to Petri nets

Uzam

Wonham

2005

Int J Adv Manuf Technol

View full text Add to dashboard Cite

In this paper a hybrid approach is proposed for supervisory control of discrete event systems (DES) subject to forbidden states. Assuming that an uncontrolled bounded Petri net (PN) model of a (plant) DES and a set of forbidden state specifications are given, the proposed approach computes a maximally permissive and nonblocking closed-loop hybrid model. The first step is to simplify the given PN model by means of PN reduction rules. The simplified model and the specifications are then represented as buffers, and supervisory control theory (SCT) is applied to obtain a Ramadge-Wonham (RW) supervisor in the form of an automaton. After reduction of the latter's state size by a 'control congruence', the simplified RW supervisor is represented by a so-called auto-net and coupled to the given uncontrolled PN plant model by means of inhibitor arcs to represent the disabling actions. The plant model and supervisor auto-net run concurrently, synchronizing on shared events. This procedure provides a maximally permissive and nonblocking 'hybrid' (mixed PN/automaton) closedloop controlled system. The method is straightforward logically, graphically, and technologically. Its applicability is shown by two examples, one of them a workcell from the PN control literature.

show abstract

Feedback control logic for forbidden-state problems of marked graphs: application to a real manufacturing system

Cited by 85 publications

References 12 publications

Deadlock freeness supervisor for marked graph

Deadlock freeness supervisor for marked graph

Confusion diagnosis and avoidance of discrete event systems using supervisory control

A hybrid approach to supervisory control of discrete event systems coupling RW supervisors to Petri nets

Contact Info

Product

Resources

About