The infimal prefix-closed and observable superlanguage of a given language
From MaRDI portal
(Redirected from Publication:1814432)
The paper deals in an abstract setting with an important control problem i.e. supervisory control of discrete-event systems under partial observation. A fixed-point characterization of observability is presented and yields an effective test for systems specified by regular languages.
Recommendations
- scientific article; zbMATH DE number 4102885
- Characterizations and effective computation of supremal relatively observable sublanguages
- On the existence of finite-state supervisors under partial observations
- Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
- scientific article; zbMATH DE number 4215376
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- Fixed point theorems and semantics: A folk tale
- Formulas for calculating supremal controllable and normal sublanguages
- scientific article; zbMATH DE number 3696510 (Why is no real title available?)
- scientific article; zbMATH DE number 3782805 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- On observability of discrete-event systems
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of discrete-event processes with partial observations
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
- The infimal closed controllable superlanguage and its application in supervisory control
Cited in
(14)- Formulae relating controllability, observability, and co-observability
- Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication
- Epistemic interpretations of decentralized discrete-event system problems
- Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation
- A summary of some discrete-event system control problems
- Supervisory Control with Partial Observations
- A modified normality condition for decentralized supervisory control of discrete event systems
- Logical models of discrete even systems: a comparative exposition
- Information tracking in games on graphs
- A uniform approach to compare architectures in decentralized discrete-event systems
- Extremal solutions of inequations over lattices with applications to supervisory control
- Offline supervisory control synthesis: taxonomy and recent developments
- Control of discrete-event systems with partial observations using coalgebra and coinduction
- Solvability of centralized supervisory control under partial observation
This page was built for publication: The infimal prefix-closed and observable superlanguage of a given language
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1814432)
