On optimal attraction in discrete-event processes

DOI10.1016/0020-0255(93)90075-WzbMath0776.93026OpenAlexW2165642210MaRDI QIDQ1204794

Yitzhak Brave, Michael Heymann

Publication date: 29 March 1993

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(93)90075-w

zbMATH Keywords

algorithmsattractiondiscrete-event processesoptimal attractionsynthesis of supervisors

Mathematics Subject Classification ID

Synthesis problems (93B50)

Related Items (12)

On-line control of partially observed discrete event systems ⋮ A matrix-based approach to verifying stability and synthesizing optimal stabilizing controllers for finite-state automata ⋮ Near-optimal online control of dynamic discrete-event systems ⋮ Synthesis of optimal covert sensor-actuator attackers for discrete-event systems ⋮ On the complexity of synthesizing a minimum-weighted supervisor under partial observation ⋮ Synthesis of minimally restrictive optimal stability-enforcing supervisors for nondeterministic discrete event systems ⋮ A framework for state attraction of discrete event systems under partial observation ⋮ Optimal supervisory control of finite state automata ⋮ Robust optimal control of regular languages ⋮ On optimal control of a class of partially observed discrete event systems ⋮ Computation of supervisors for reconfigurable machine tools ⋮ New results on supervisor localization, with case studies

Cites Work

• Self-stabilizing extensions for message-passing systems
• Stabilization of discrete-event processes
• The infimal closed controllable superlanguage and its application in supervisory control
• Supervisory Control of a Class of Discrete Event Processes
• Self-stabilizing systems in spite of distributed control
• Stability and stabilizability of discrete event dynamic systems
• Modular Feedback Logic for Discrete Event Systems

This page was built for publication: On optimal attraction in discrete-event processes