New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage
From MaRDI portal
Publication:4566940
Recommendations
- Characterizations and effective computation of supremal relatively observable sublanguages
- Relative Observability of Discrete-Event Systems and Its Supremal Sublanguages
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
- Correction to “Relative Observability of Discrete-Event Systems and Its Supremal Sublanguages”
- Characterization of co-observable languages and formulas for their super/sublanguages
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
- Complexity of Infimal Observable Superlanguages
- Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
- Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage
- On computation of supremal controllable, normal sublanguages
Cited in
(4)- Characterizations and effective computation of supremal relatively observable sublanguages
- Characterization of co-observable languages and formulas for their super/sublanguages
- Optimal supervisory control with mean payoff objectives and under partial observation
- Robust supervisory control of discrete event systems against intermittent loss of observations
This page was built for publication: New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566940)