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)
Formal languages and automata (68Q45) Synthesis problems (93B50) Theory of operating systems (68N25) Model systems in control theory (93C99)
Related Items
Solvability of centralized supervisory control under partial observation ⋮ A new class of supervisors for timed discrete event systems under partial observation ⋮ Stabilization of discrete-event processes ⋮ Supervisory control of state-tree structures with partial observation ⋮ On controllability and normality of discrete event dynamical systems ⋮ Active fault tolerant control of discrete event systems using online diagnostics ⋮ Supervisory control of a class of concurrent discrete event systems under partial observation ⋮ Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control ⋮ Current-state opacity enforcement in discrete event systems under incomparable observations ⋮ Characterizations and effective computation of supremal relatively observable sublanguages ⋮ Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage ⋮ Relative coobservability for decentralised supervisory control of discrete-event systems ⋮ Formulas for calculating supremal controllable and normal sublanguages ⋮ Synthesis of maximally permissive supervisors for similarity control of partially observed nondeterministic discrete event systems ⋮ Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations ⋮ Supervisory Control with Partial Observations ⋮ Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation ⋮ Dealing with sensor and actuator deception attacks in supervisory control ⋮ Synthesis of winning attacks on communication protocols using supervisory control theory: two case studies ⋮ Control of discrete-event systems with partial observations using coalgebra and coinduction
Cites Work