On computation of supremal controllable, normal sublanguages

DOI10.1016/J.SYSCONLE.2005.01.005MaRDI QIDQ2504587zbMATH OpenOpenAlexFDO

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

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

normalitycontrollabilitydiscrete-event systemssupervisory controlnonblocking system

Mathematics Subject Classification ID

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

Recommendations

• Formulas for calculating supremal controllable and normal sublanguages
• Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage
• A Note on the Properties of the Supremal Controllable Sublanguage in Pushdown Systems
• Distributed computation of supremal conditionally controllable sublanguages
• Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
• Characterizations and effective computation of supremal relatively observable sublanguages
• A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages
• OPTIMAL SUPERVISORY CONTROL OF REGULAR LANGUAGES
• On the supremal controllable sublanguage in the discrete-event model of nondeterministic hybrid control systems
• scientific article; zbMATH DE number 4215376

Cites work

• scientific article; zbMATH DE number 3959244 (Why is no real title available?)
• Decentralized supervisory control of discrete-event systems
• Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
• Formulas for calculating supremal controllable and normal sublanguages
• On controllability and normality of discrete event dynamical systems
• On observability of discrete-event systems
• Supervisory Control of a Class of Discrete Event Processes
• Supervisory control of discrete-event processes with partial observations

Cited in

(14)

• Synthesis of covert actuator and sensor attackers
• Characterizations and effective computation of supremal relatively observable sublanguages
• New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage
• Supervisory Control with Partial Observations
• scientific article; zbMATH DE number 434954 (Why is no real title available?)
• Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage
• Formulas for calculating supremal controllable and normal sublanguages
• Supervisory control of state-tree structures with partial observation
• Supervisory control of switching control systems
• On the computation of natural observers in discrete-event systems
• Distributed computation of supremal conditionally controllable sublanguages
• A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages
• Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
• Networked supervisor synthesis against lossy channels with bounded network delays as non-networked synthesis

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

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