Characterizations and effective computation of supremal relatively observable sublanguages

DOI10.1007/S10626-017-0250-0zbMATH Open1398.93213arXiv1609.02251OpenAlexW2963703947MaRDI QIDQ1788694FDOQ1788694

Renyuan Zhang, W. Murray Wonham, Kai Cai

Publication date: 8 October 2018

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1609.02251

zbMATH Keywords

regular languageautomatadiscrete-event systemssupervisory controlsupport relationNerode equivalence relationpartial-observationrelative observability

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• On observability of discrete-event systems
• Predicates and predicate transformers for supervisory control of discrete event dynamical systems
• Formulas for calculating supremal controllable and normal sublanguages
• Supervisory control of discrete-event processes with partial observations
• On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
• A Uniform Approach for Synthesizing Property-Enforcing Supervisors for Partially-Observed Discrete-Event Systems
• Relative Observability of Discrete-Event Systems and Its Supremal Sublanguages
• Relative Observability and Coobservability of Timed Discrete-Event Systems
• New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage

Cited In (4)

• New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage
• Characterization of co-observable languages and formulas for their super/sublanguages
• On computation of supremal controllable, normal sublanguages
• 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)