Formulas for calculating supremal controllable and normal sublanguages
From MaRDI portal
Publication:752649
DOI10.1016/0167-6911(90)90004-EzbMath0715.93044OpenAlexW2013460416MaRDI QIDQ752649
Feng Lin, W. Murray Wonham, Ratnesh Kumar, Vijay K. Garg, Robert D. Brandt, Steven I. Marcus
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
controllabilitynormalitysupervisory controldiscrete event systemssupremal controllable sublanguagessupremal normal sublanguages
Related Items (32)
On-line control of partially observed discrete event systems ⋮ Supervisory control of discrete event systems ⋮ Computation of controllable and coobservable sublanguages in decentralized supervisory control via communication ⋮ A survey on compositional algorithms for verification and synthesis in supervisory control ⋮ Supervisory control synthesis of discrete-event systems using a coordination scheme ⋮ Supervisory control of state-tree structures with partial observation ⋮ Robust nonblocking supervisory control of discrete-event systems under partial observation ⋮ Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation ⋮ Supervisory control of modular systems with global specification languages ⋮ Maximizing robustness of supervisors for partially observed discrete event systems. ⋮ On tolerable and desirable behaviors in supervisory control of discrete event systems ⋮ On nonconflicting languages that arise in supervisory control of discrete event systems ⋮ Extremal solutions of inequations over lattices with applications to supervisory control ⋮ Control of discrete-event systems with modular or distributed structure ⋮ On controllability and normality of discrete event dynamical systems ⋮ Decentralized supervisory control of discrete event systems with nonhomogeneous control structure ⋮ Synthesis of controllable and normal sublanguages for discrete-event systems using a coordinator ⋮ Opacity of discrete event systems and its applications ⋮ Estimate based limited lookahead supervisory control for closed language specifications ⋮ On computation of supremal controllable, normal sublanguages ⋮ Logical models of discrete even systems: a comparative exposition ⋮ 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 ⋮ Coordination Control of Distributed Discrete-Event Systems ⋮ The infimal prefix-closed and observable superlanguage of a given language ⋮ Supervisory Control with Complete Observations ⋮ Supervisory Control with Partial Observations ⋮ Centralized and distributed algorithms for on-line synthesis of maximal control policies under partial observation ⋮ On optimal control of a class of partially observed discrete event systems ⋮ Synthesis of winning attacks on communication protocols using supervisory control theory: two case studies ⋮ Input/output discrete event processes and communication delays ⋮ Control of discrete-event systems with partial observations using coalgebra and coinduction
Cites Work
- Unnamed Item
- Unnamed Item
- On observability of discrete-event systems
- On supremal languages of classes of sublanguages that arise in supervisor synthesis problems with partial observation
- Modular supervisory control of discrete-event systems
- Decentralized supervisory control of discrete-event systems
- Supervisory Control of a Class of Discrete Event Processes
- Supervisory control of discrete-event processes with partial observations
- Supervisor specification and synthesis for discrete event systems
- Supremal and maximal sublanguages arising in supervisor synthesis problems with partial observations
- Supervisory control of timed discrete-event systems under partial observation
This page was built for publication: Formulas for calculating supremal controllable and normal sublanguages
