On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
From MaRDI portal
Publication:1108988
DOI10.1007/BF02551361zbMath0654.93046MaRDI QIDQ1108988
Publication date: 1989
Published in: MCSS. Mathematics of Control, Signals, and Systems (Search for Journal in Brave)
discrete-event systems; automata; supervisor synthesis; partial observations; recognizable languages
68Q45: Formal languages and automata
93B50: Synthesis problems
68N25: Theory of operating systems
93C99: Model systems in control theory
Related Items
Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations, Active fault tolerant control of discrete event systems using online diagnostics, Formulas for calculating supremal controllable and normal sublanguages, Control of discrete-event systems with partial observations using coalgebra and coinduction, Solvability of centralized supervisory control under partial observation, A new class of supervisors for timed discrete event systems under partial observation, On controllability and normality of discrete event dynamical systems, Supervisory control of a class of concurrent discrete event systems under partial observation, Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage, Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control, Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation, Stabilization of discrete-event processes
Cites Work
