A characterization of realizable behavior in supervisory control of timed event graphs
DOI10.1016/S0005-1098(97)00121-0zbMATH Open0924.93003MaRDI QIDQ1129729FDOQ1129729
Authors: Shigemasa Takai
Publication date: 20 August 1998
Published in: Automatica (Search for Journal in Brave)
Recommendations
discrete event systemsupervisory controltimed event graphsmax-algebrastrong controllabilitysupremal strongly controllable subset
Controllability (93B05) Hierarchical systems (93A13) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)
Cites Work
- Title not available (Why is that?)
- Minimax algebra
- Supervisory Control of a Class of Discrete Event Processes
- Modular supervisory control of discrete-event systems
- Internal model control and max-algebra: controller design
- Predicates and predicate transformers for supervisory control of discrete event dynamical systems
- Modular Feedback Logic for Discrete Event Systems
- Control of vector discrete-event systems. I. The base model
- Extremal solutions of inequations over lattices with applications to supervisory control
- Supervisory control of real-time discrete-event systems using lattice theory
Cited In (4)
This page was built for publication: A characterization of realizable behavior in supervisory control of timed event graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129729)