On the computation of observers in discrete-event systems
From MaRDI portal
(Redirected from On the computation of observers in discrete-event systems)
Recommendations
Cited in
(19)- Stabilizing observers
- System theory for system identification.
- Computing observers from observation policies in discrete-event systems
- Compositional coordinator synthesis of extended finite automata
- Using subobservers to synthesize opacity-enforcing supervisors
- Hierarchical modelling of manufacturing systems using discrete event systems and the conflict preorder
- Control protocol synthesis for multi-agent systems with similar actions instantiated from agent and requirement templates
- Delay-robustness in distributed control of timed discrete-event systems based on supervisor localisation
- Generalised projections in finite state automata and decidability of state determinacy
- On the complexity of synthesizing a minimum-weighted supervisor under partial observation
- Distributed supervisory control of discrete-event systems with communication delay
- Minimal sensor activation and minimal communication in discrete-event systems
- Nonblocking check in fuzzy discrete event systems based on observation equivalence
- A language measure for partially observed discrete event systems
- On the computation of natural observers in discrete-event systems
- Overview of networked supervisory control with imperfect communication channels
- On algorithms verifying initial-and-final-state opacity: complexity, special cases, and comparison
- Hierarchical fault diagnosis for discrete-event systems under global consistency
- Nonconflict check by using sequential automaton abstractions based on weak observation equivalence
This page was built for publication: On the computation of observers in discrete-event systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1424973)