On computation of supremal controllable, normal sublanguages

DOI10.1016/J.SYSCONLE.2005.01.005zbMath1129.93453OpenAlexW2063239682MaRDI QIDQ2504587

S. Hashtrudi Zad, W. Murray Wonham, Mohammad Moosaei

Publication date: 25 September 2006

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sysconle.2005.01.005

zbMATH Keywords

controllabilitynormalitysupervisory controldiscrete-event systemsnonblocking system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Control/observation systems involving computers (process control, etc.) (93C83) Discrete event control/observation systems (93C65)

Related Items (5)

Networked supervisor synthesis against lossy channels with bounded network delays as non-networked synthesis ⋮ Synthesis of covert actuator and sensor attackers ⋮ Supervisory control of state-tree structures with partial observation ⋮ Supervisory control of switching control systems ⋮ Supervisory Control with Partial Observations

Cites Work

• Unnamed Item
• Formulas for calculating supremal controllable and normal sublanguages
• On observability of discrete-event systems
• On controllability and normality of discrete event dynamical systems
• Decentralized supervisory control of discrete-event systems
• Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
• Supervisory Control of a Class of Discrete Event Processes
• Supervisory control of discrete-event processes with partial observations

This page was built for publication: On computation of supremal controllable, normal sublanguages