Time Floating General Mutual Exclusion Constraints (TFGMEC)

Achour, Zied; Rezg, Nidhal

doi:10.1109/cesa.2006.4281778

Cited by 9 publications

(19 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A great research interest is stimulated by their theory and many approaches are proposed in the framework of automata to synthesize desirable supervisors [1], [2], [10], [23]. Nevertheless, the application of these research results is somewhat limited since they involve exhaustive enumeration of all the states.…”

Section: Introductionmentioning

confidence: 99%

“…In a realistic system, the behavior of systems is highly dependent on the values of time. Thus, time constraints are of explicit concern in many cases [1], [2], [4]. This necessitates the incorporation of time dimension in the formalism of supervisory control.…”

Section: Introductionmentioning

confidence: 99%

“…This necessitates the incorporation of time dimension in the formalism of supervisory control. In [1], a new class of GMEC, namely Timed GMEC (TGMEC), is proposed so as to integrate time in the specification. To synthesize a supervisor, a control place (monitor, for short) is produced using the theory of regions.…”

Section: Introductionmentioning

confidence: 99%

“…We use such an improvement to overcome the above-mentioned drawbacks in [1]. For the first time, the theoretical results in [13] are employed to implement TGMEC without generating reachability graphs.…”

Section: Introductionmentioning

confidence: 99%

“…Section III is devoted to a special class of Petri nets, on which our proposed method is experimented. For comparison, the method in [1] is also briefly reviewed. In Section IV, following the theoretical work in [13], our method is proposed to derive a supervisor without enumerating the reachability graph.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Algebraic Synthesis of Timed Supervisor for Automated Manufacturing Systems Using Petri Nets

Zhou

2010

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

For practical automated manufacturing systems (AMSs), the time dimension is of great significance and should be integrated in their plant models. Reasonably, many of the realistic general mutual exclusion constraints (GMECs) imposed on these discrete models should be timed rather than merely algebraic or logic. In the past, such a problem was studied on the basis of the Ramadge-Wonham supervisory control technique (SCT) and the theory of regions. It proves to be NP-hard since it necessitates the generation of reachability graphs. This paper shows that it can be solvable in polynomial time by using generalized linear constraints, which are originally proposed to increase the expressive power of the linear marking constraints. By dividing each constraint into marking, firing vector, and Parikh terms, its respective control place can be synthesized algebraically without considering the separation of dangerous states and events. Several examples are used to validate the effectiveness and efficiency of the proposed approach. Note To Practitioners-This paper concerns about the supervisor design with the involvement of global time information, which is motivated by industrial applications where time dimension is crucial for their elaborate characterization. These applications, particularly arising in AMS, show that supervisory control specifications may be strongly related to time and would be quite impractical without taking into account indices such as global time.Previously, such a problem is proposed to be dealt with through a methodology based on the Ramadge-Wonham approach and the theory of regions, which is ineffective owing to the excessive computational time. The goal of this paper is to propose an algebraic synthesis method that can tackle this problem effectively yet remain tractable. Both theoretical and experimental results demonstrate Manuscript

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Algebraic Synthesis of Timed Supervisor for Automated Manufacturing Systems Using Petri Nets

Zhou

2010

IEEE Trans. Automat. Sci. Eng.

View full text Add to dashboard Cite

show abstract

State‐Feedback Control for a Class of Timed Petri Nets Subject to Marking Constraints

Tebani

Amari

Kara

2018

Asian Journal of Control

View full text Add to dashboard Cite

The paper contributes with an original method of designing a control for discrete event systems modeled by a class of timed Petri nets. Precisely, this work deals with the closed loop control of Timed Event Graphs (TEGs) under specifications expressed with linear marking constraints. The objective of the controller is to limit the number of tokens in some places of these TEGs. The behavior of TEGs is represented by a system of difference equations that are linear in Min-Plus algebra and the constraints are described by a set of inequalities, which are also linear in Min-Plus algebra. A formal approach to design control laws that guarantee compliance with these marking constraints is proposed. For this, two sufficient conditions for the existence of control laws are proposed. The computed controls are causal feedbacks, which can be represented by a set of marked and timed places. The proposed method is illustrated in two applications: a manufacturing production line and an assembly system.

show abstract

Control of a class of discrete event systems with disturbances and capacity constraints: Application to a disassembly problem

Syrine,

Said,

Hichem

2023

Asian Journal of Control

View full text Add to dashboard Cite

This study proposes an analytical control method for the meeting of capacity constraints in discrete event systems with disturbances. More precisely, it consists of computing control laws for partially controllable and observable timed event graphs that are subject to marking constraints. To resolve the issue, linear Min‐Plus models are used to describe the behavior of these graphs, and the constraints are expressed by inequalities in Min‐Plus algebra. Sufficient conditions for the existence of causal control laws to guarantee marking specifications are established. Finally, to illustrate the efficiency of the proposed approaches in this paper, an application for a disassembly process with some disturbance inputs and limited component capacities is carried out.

show abstract

Time Floating General Mutual Exclusion Constraints (TFGMEC)

Cited by 9 publications

References 4 publications

Algebraic Synthesis of Timed Supervisor for Automated Manufacturing Systems Using Petri Nets

Algebraic Synthesis of Timed Supervisor for Automated Manufacturing Systems Using Petri Nets

State‐Feedback Control for a Class of Timed Petri Nets Subject to Marking Constraints

Control of a class of discrete event systems with disturbances and capacity constraints: Application to a disassembly problem

Contact Info

Product

Resources

About