The infimal controllable and N-observable superpredicate of a given predicate
From MaRDI portal
Recommendations
- Characterization of all M-controllable subpredicates of a given predicate
- A Note on the Properties of the Supremal Controllable Sublanguage in Pushdown Systems
- Formulas for a class of controllable and observable sublanguages larger than the supremal controllable and normal sublanguage
- An epistemic predicate \(\mathrm{CTL}^{*}\) for finite control \(\pi\)-processes
- The infimal closed controllable superlanguage and its application in supervisory control
- Effective computation of an \(L_{m}(G)\)-closed, controllable, and observable sublanguage arising in supervisory control
- A non-definability result for a predicational language with the usual control
- Complexity of Infimal Observable Superlanguages
- scientific article; zbMATH DE number 1223723
- scientific article; zbMATH DE number 3906478
Cited in
(5)- Controllability of predicates and languages in discrete-event systems
- Characterization of all M-controllable subpredicates of a given predicate
- M -controllable subpredicates arising in state feed back control of discrete event systems
- scientific article; zbMATH DE number 1836384 (Why is no real title available?)
- Predicates and predicate transformers for supervisory control of discrete event dynamical systems
This page was built for publication: The infimal controllable and N-observable superpredicate of a given predicate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4850257)
