Compromise approach for predictive control of timed event graphs with specifications defined by P-time event graphs

DOI10.1007/s10626-016-0227-4zbMath1357.93062OpenAlexW2336130986MaRDI QIDQ513816

Philippe Declerck

Publication date: 8 March 2017

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10626-016-0227-4

zbMATH Keywords

consistencyfixed pointcausalitytimed event graphspredictive controlP-time Petri nets

Mathematics Subject Classification ID

Applications of graph theory (05C90) Discrete event control/observation systems (93C65)

Cites Work

• Unnamed Item
• Unnamed Item
• On the control of max-plus linear system subject to state restriction
• The equation \(A \otimes x = B \otimes y\) over \((\max,+)\)
• Max-algebra: The linear algebra of combinatorics?
• Predictive control of timed event graphs with specifications defined by P-time event graphs
• Stabilization of max-plus-linear systems using model predictive control: the unconstrained case
• Complexity reduction in MPC for stochastic max-plus-linear discrete event systems by variability expansion
• Max-linear Systems: Theory and Algorithms
• Discrete Event Systems in Dioid Algebra and Conventional Algebra
• Max-Plus $(A,B)$-Invariant Spaces and Control of Timed Discrete-Event Systems
• Max-Plus Control Design for Temporal Constraints Meeting in Timed Event Graphs
• Model predictive control for max-plus-linear discrete event systems

This page was built for publication: Compromise approach for predictive control of timed event graphs with specifications defined by P-time event graphs