On asymptotically efficient solutions for a class of supervisory control problems

DOI10.1109/9.545713MaRDI QIDQ3124459zbMATH OpenOpenAlexFDO

Authors R. Sreenivas

Publication date 5 November 1998

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

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

zbMATH Keywords

storage requirementcomplexity of supervisory controllimiting problem instancerestricted sequences of forbidden-string and forbidden-state problems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Hierarchical systems (93A13) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Recommendations

• On supervisory control of sequential behaviors
• On the existence of finite state supervisors for arbitrary supervisory control problems
• Supervision of Infinite Behavior of Discrete-Event Systems

Cited in

(3)

• Solvability of centralized supervisory control under partial observation
• Synthesis of Maximally-Permissive Supervisors for the Range Control Problem
• Supervisory acceleration of convergence for homogeneous systems

This page was built for publication: On asymptotically efficient solutions for a class of supervisory control problems

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