Control laws synthesis for timed event graphs subject to generalised marking constraints by Min-Plus algebra: application to cluster tools
From MaRDI portal
Publication:6548596
DOI10.1080/00207179.2023.2183344zbMATH Open1537.93482MaRDI QIDQ6548596FDOQ6548596
Authors: Jihene Rajah, Karima Tebani, Saïd Amari, Maher Barkallah, Mohamed Haddar 
Publication date: 1 June 2024
Published in: International Journal of Control (Search for Journal in Brave)
Recommendations
- Control laws synthesis to satisfy generalized mutual exclusion constraints for timed event graphs networks using min-plus algebra
- An algebraic control method to guarantee generalized marking constraints for partially observable timed event graphs
- Feedback control for a class of discrete event systems with critical time
- Feedback control to guarantee marking constraints in timed event graphs including disturbances: application to disassembly systems
- Design of control laws for timed event graphs networks subject to mutual exclusion constraints in min-plus algebra
Max-plus and related algebras (15A80) Discrete event control/observation systems (93C65) Semirings (16Y60) Algebraic methods (93B25)
Cites Work
- Title not available (Why is that?)
- Duality between invariant spaces for max-plus linear discrete event systems
- Max-Plus $(A,B)$-Invariant Spaces and Control of Timed Discrete-Event Systems
- On the control of max-plus linear system subject to state restriction
- Controlled and conditioned invariant subspaces in linear system theory
- Feedback control of Petri nets based on place invariants
- Petri net controllers for generalized mutual exclusion constraints with floor operators
- Max-Plus Control Design for Temporal Constraints Meeting in Timed Event Graphs
- Synthesis of greatest linear feedback for timed-event graphs in dioid
- Feedback control logic for forbidden-state problems of marked graphs: application to a real manufacturing system
- Just in time control of constrained \((max,+)\)-linear systems
- Min-plus realizable control design for partially observable timed event graphs under marking constraints
- Title not available (Why is that?)
- An Approach to Improve Permissiveness of Supervisors for GMECs in Time Petri Net Systems
- Scheduling and control of real-time systems based on a token player approach
- Controller synthesis with highly simplified linear constraints
- Supervisor synthesis for enforcing linear constraints on a class of Petri nets with unobservable transitions
- Closed-Loop Deadlock-Free Supervision for GMECs in Time Petri Net Systems
- Supervisory Control of Timed Discrete-Event Systems With Logical and Temporal Specifications
- Controlled invariance and dynamic feedback for systems over semirings
Cited In (4)
- Feedback control to guarantee marking constraints in timed event graphs including disturbances: application to disassembly systems
- An algebraic control method to guarantee generalized marking constraints for partially observable timed event graphs
- Control of a class of discrete event systems with disturbances and capacity constraints: application to a disassembly problem
- Control laws synthesis to satisfy generalized mutual exclusion constraints for timed event graphs networks using min-plus algebra
This page was built for publication: Control laws synthesis for timed event graphs subject to generalised marking constraints by Min-Plus algebra: application to cluster tools
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6548596)
