Formulas for the extremal controllable sequences in timed-event graphs

DOI10.1109/9.720510MaRDI QIDQ4506569zbMATH OpenOpenAlexFDO

Authors Shigemasa Takai, Shinzo Kodama

Publication date 17 October 2000

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/9.720510

zbMATH Keywords

controllable sequencesdiscrete-event systemmax-algebra modelsupervisory controltimed event graphs

Mathematics Subject Classification ID

Controllability (93B05) Discrete event control/observation systems (93C65)

Recommendations

• Max-Plus Control Design for Temporal Constraints Meeting in Timed Event Graphs
• Optimal Control Synthesis of Timed Event Graphs With Interval Model Specifications
• Approximated timed reachability graphs for the robust control of discrete event systems
• Algebraic approaches for designing control laws of time-constrained networked conflicting timed event graphs
• On the Steady-State Control of Timed Event Graphs With Firing Date Constraints
• Design of control laws for timed event graphs networks subject to mutual exclusion constraints in min-plus algebra
• A graph-theoretic optimal control problem for terminating discrete event processes
• On just-in-time control of timed event graphs with input constraints: a semimodule approach
• Supervisory control of extended timed event graphs
• Optimal closed-loop control of timed event graphs in dioids

Cited in

(3)

• A characterization of realizable behavior in supervisory control of timed event graphs
• Supervisory control of extended timed event graphs
• Design of control laws for timed event graphs networks subject to mutual exclusion constraints in min-plus algebra

This page was built for publication: Formulas for the extremal controllable sequences in timed-event graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4506569)