Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
From MaRDI portal
Publication:4733422
Recommendations
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
- 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
- Online supervisor synthesis for partially observed discrete-event systems
- scientific article; zbMATH DE number 744041
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- Circuits including a given set of vertices
- Decentralized supervisory control of discrete-event systems
- Modular Feedback Logic for Discrete Event Systems
- Modular supervisory control of discrete-event systems
- On observability of discrete-event systems
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
- Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of discrete-event processes with partial observations
Cited in
(16)- Using subobservers to synthesize opacity-enforcing supervisors
- Characterizations and effective computation of supremal relatively observable sublanguages
- Control of discrete-event systems with partial observations using coalgebra and coinduction
- New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
- Supervisory Control with Partial Observations
- Characterization of co-observable languages and formulas for their super/sublanguages
- On controllability and normality of discrete event dynamical systems
- 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
- On the complexity of synthesizing a minimum-weighted supervisor under partial observation
- Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation
- Codiagnosability of discrete event systems revisited: a new necessary and sufficient condition and its applications
- The infimal prefix-closed and observable superlanguage of a given language
- Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
- On the corrective control of sequential machines
This page was built for publication: Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733422)
