Characterizations and effective computation of supremal relatively observable sublanguages
From MaRDI portal
Abstract: Recently we proposed relative observability for supervisory control of discrete-event systems under partial observation. Relative observability is closed under set unions and hence there exists the supremal relatively observable sublanguage of a given language. In this paper we present a new characterization of relative observability, based on which an operator on languages is proposed whose largest fixpoint is the supremal relatively observable sublanguage. Iteratively applying this operator yields a monotone sequence of languages; exploiting the linguistic concept of support based on Nerode equivalence, we prove for regular languages that the sequence converges finitely to the supremal relatively observable sublanguage, and the operator is effectively computable. Moreover, for the purpose of control, we propose a second operator that in the regular case computes the supremal relatively observable and controllable sublanguage. The computational effectiveness of the operator is demonstrated on a case study.
Recommendations
- Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
- Relative coobservability for decentralised supervisory control of discrete-event systems
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
- On computation of supremal controllable, normal sublanguages
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?)
- A Uniform Approach for Synthesizing Property-Enforcing Supervisors for Partially-Observed Discrete-Event Systems
- Formulas for calculating supremal controllable and normal sublanguages
- New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage
- On observability of discrete-event systems
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
- Predicates and predicate transformers for supervisory control of discrete event dynamical systems
- Relative Observability and Coobservability of Timed Discrete-Event Systems
- Relative Observability of Discrete-Event Systems and Its Supremal Sublanguages
- Supervisory control of discrete-event processes with partial observations
Cited in
(8)- 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
- Relative coobservability for decentralised supervisory control of discrete-event systems
- Characterization of co-observable languages and formulas for their super/sublanguages
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
- On computation of supremal controllable, normal sublanguages
- Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
- Approximation of sets of superwords by L-language formulas
This page was built for publication: Characterizations and effective computation of supremal relatively observable sublanguages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1788694)
