On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
This paper characterizes the class of closed and (M,N)-recognizable languages in terms of certain structural aspects of relevant automata. This characterization leads to algorithms that effectively compute the supremal (M,N)-recognizable sublanguage of a given language. One of these algorithms is used, in an alternating manner with an algorithm which yields the supremal \((\Sigma_ u,N)\)-invariant sublanguage, to compute the supremal sublanguage of a given language that is both \((\Sigma_ u,N)\)-invariant and (M,N)-recognizable. Finite convergence of the resulting algorithm is proved. An example illustrates the use of these algorithms.
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
- Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
- Characterizations and effective computation of supremal relatively observable sublanguages
- Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage
- An algorithm for computing the mask value of the supremal normal sublanguage of a legal language
- scientific article; zbMATH DE number 4051454 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- Modular supervisory control of discrete-event systems
- On observability of discrete-event systems
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of discrete-event processes with partial observations
- On controllability and normality of discrete event dynamical systems
- Supervisory control of a class of concurrent discrete event systems under partial observation
- Current-state opacity enforcement in discrete event systems under incomparable observations
- Characterizations and effective computation of supremal relatively observable sublanguages
- Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage
- Synthesis of sup-interpretations: a survey
- Synthesis of maximally permissive supervisors for similarity control of partially observed nondeterministic discrete event systems
- Dealing with sensor and actuator deception attacks in supervisory control
- Synthesis of winning attacks on communication protocols using supervisory control theory: two case studies
- Supervisory control of state-tree structures with partial observation
- Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
- Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation
- Supervisory control synthesis for deterministic context free specification languages. Enforcing controllability least restrictively
- Stabilization of discrete-event processes
- New Algorithms for Verification of Relative Observability and Computation of Supremal Relatively Observable Sublanguage
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
- An algorithm for computing the mask value of the supremal normal sublanguage of a legal language
- Relative coobservability for decentralised supervisory control of discrete-event systems
- Characterization of co-observable languages and formulas for their super/sublanguages
- Active fault tolerant control of discrete event systems using online diagnostics
- Supervisory Control with Partial Observations
- Enhancing sensor attack detection in supervisory control systems modeled by probabilistic automata
- Formulas for calculating supremal controllable and normal sublanguages
- Control of discrete-event systems with partial observations using coalgebra and coinduction
- Solvability of centralized supervisory control under partial observation
- A new class of supervisors for timed discrete event systems under partial observation
This page was built for publication: On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1108988)
