New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage
From MaRDI portal
Publication:4566940
DOI10.1109/TAC.2016.2644640zbMath1390.93522OpenAlexW2561784930MaRDI QIDQ4566940
Marcos V. S. Alves, Lilian Kawakami Carvalho, João Carlos 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
Formal languages and automata (68Q45) Discrete event control/observation systems (93C65) Observability (93B07)
Related Items (3)
Optimal supervisory control with mean payoff objectives and under partial observation ⋮ Characterizations and effective computation of supremal relatively observable sublanguages ⋮ 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