New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage

DOI10.1109/TAC.2016.2644640zbMATH Open1390.93522OpenAlexW2561784930MaRDI QIDQ4566940FDOQ4566940

Authors: Marcos V. S. Alves, Lilian Kawakami Carvalho, J. C. Basilio

Publication date: 27 June 2018

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tac.2016.2644640

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Observability (93B07) Discrete event control/observation systems (93C65)

Cited In (4)

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)