A characterization of realizable behavior in supervisory control of timed event graphs

DOI10.1016/S0005-1098(97)00121-0zbMath0924.93003MaRDI QIDQ1129729

Shigemasa Takai

Publication date: 20 August 1998

Published in: Automatica (Search for Journal in Brave)

zbMATH Keywords

discrete event systemsupervisory controltimed event graphsmax-algebrastrong controllabilitysupremal strongly controllable subset

Mathematics Subject Classification ID

Controllability (93B05) Hierarchical systems (93A13) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (1)

Supervisory control of extended timed event graphs

Cites Work

• Unnamed Item
• Extremal solutions of inequations over lattices with applications to supervisory control
• Modular supervisory control of discrete-event systems
• Minimax algebra
• Control of vector discrete-event systems. I. The base model
• Supervisory Control of a Class of Discrete Event Processes
• Supervisory control of real-time discrete-event systems using lattice theory
• 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

This page was built for publication: A characterization of realizable behavior in supervisory control of timed event graphs