Formulas for calculating supremal controllable and normal sublanguages
From MaRDI portal
Publication:752649
DOI10.1016/0167-6911(90)90004-EzbMATH Open0715.93044OpenAlexW2013460416MaRDI QIDQ752649FDOQ752649
Authors: Feng Lin, Robert D. Brandt, Vijay K. Garg, Ratnesh Kumar, Steven I. Marcus, W. Murray Wonham 
Publication date: 1990
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6911(90)90004-e
Recommendations
- Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage
- On nonconflicting languages that arise in supervisory control of discrete event systems
- On computation of supremal controllable, normal sublanguages
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
- Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
normalitycontrollabilitydiscrete event systemssupervisory controlsupremal controllable sublanguagessupremal normal sublanguages
Cites Work
- Supervisory Control of a Class of Discrete Event Processes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modular supervisory control of discrete-event systems
- Decentralized supervisory control of discrete-event systems
- On observability of discrete-event systems
- 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
- Supervisor specification and synthesis for discrete event systems
- Supervisory control of timed discrete-event systems under partial observation
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
Cited In (33)
- Decentralized supervisory control of discrete event systems with nonhomogeneous control structure
- Synthesis of winning attacks on communication protocols using supervisory control theory: two case studies
- Characterizations and effective computation of supremal relatively observable sublanguages
- Control of discrete-event systems with partial observations using coalgebra and coinduction
- Supervisory Control with Partial Observations
- Supervisory control of discrete event systems
- Maximizing robustness of supervisors for partially observed discrete event systems.
- On controllability and normality of discrete event dynamical systems
- Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage
- On-line control of partially observed discrete event systems
- Supervisory control of state-tree structures with partial observation
- Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator
- Robust nonblocking supervisory control of discrete-event systems under partial observation
- Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation
- Estimate based limited lookahead supervisory control for closed language specifications
- A survey on compositional algorithms for verification and synthesis in supervisory control
- On computation of supremal controllable, normal sublanguages
- Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation
- On tolerable and desirable behaviors in supervisory control of discrete event systems
- On nonconflicting languages that arise in supervisory control of discrete event systems
- Control of discrete-event systems with modular or distributed structure
- Supervisory control synthesis of discrete-event systems using a coordination scheme
- A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages
- Input/output discrete event processes and communication delays
- Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication
- The infimal prefix-closed and observable superlanguage of a given language
- On optimal control of a class of partially observed discrete event systems
- Supervisory Control with Complete Observations
- Supervisory control of modular systems with global specification languages
- Coordination Control of Distributed Discrete-Event Systems
- Opacity of discrete event systems and its applications
- Logical models of discrete even systems: a comparative exposition
- Extremal solutions of inequations over lattices with applications to supervisory control
This page was built for publication: Formulas for calculating supremal controllable and normal sublanguages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q752649)
