The authors discuss supervisory control of probabilistic discrete event systems. Supervisors for such systems will take probabilities of event occurrences into consideration in making control decisions. The authors introduce a concept called "/spl epsiv/-containment of a given language" and subsequently study its algebraic properties. They discuss standard supervisor (with only enablement/disablement) synthesis problems and reset supervisor (with recovery mechanism) synthesis problems for both fully observed and partially observed systems.
No takes yet. Share an insight, caveat, or question.
Li et al. (1999) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: